Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics

Rica Gonen; Daniel Lehmann

doi:10.1145/352871.352873

Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics

Rica Gonen, Daniel Lehmann

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Finding optimal solutions for multi-unit combinatorial auc- tions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-and-Bound techniques: they require both a way to bound from above the value of the best allocation and a good criterion to decide which bids are to be tried first. Different methods for e ciently bounding from above the value of the best allocation are considered. Theoretical original results characterize the best approximation ratio and the ordering criterion that provides it. We suggest to use this criterion.

Original language	English
Title of host publication	EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce
Publisher	Association for Computing Machinery, Inc
Pages	13-20
Number of pages	8
ISBN (Electronic)	9781581132724
DOIs	https://doi.org/10.1145/352871.352873
State	Published - 17 Oct 2000
Externally published	Yes
Event	2nd ACM Conference on Electronic Commerce, EC 2000 - Minneapolis, United States Duration: 17 Oct 2000 → 20 Oct 2000

Publication series

Name	EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce

Conference

Conference	2nd ACM Conference on Electronic Commerce, EC 2000
Country/Territory	United States
City	Minneapolis
Period	17/10/00 → 20/10/00

Bibliographical note

Publisher Copyright:
© 2000 ACM. All rights reserved.

Keywords

branch and bound
combinatorial auctions

Access to Document

10.1145/352871.352873

Cite this

@inproceedings{e16edf380de942d196237b363ffba04a,

title = "Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics",

abstract = "Finding optimal solutions for multi-unit combinatorial auc- tions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-and-Bound techniques: they require both a way to bound from above the value of the best allocation and a good criterion to decide which bids are to be tried first. Different methods for e ciently bounding from above the value of the best allocation are considered. Theoretical original results characterize the best approximation ratio and the ordering criterion that provides it. We suggest to use this criterion.",

keywords = "branch and bound, combinatorial auctions",

author = "Rica Gonen and Daniel Lehmann",

year = "2000",

month = oct,

day = "17",

doi = "10.1145/352871.352873",

language = "אנגלית",

series = "EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce",

publisher = "Association for Computing Machinery, Inc",

pages = "13--20",

booktitle = "EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce",

}

Gonen, R & Lehmann, D 2000, Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics. in EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce. EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce, Association for Computing Machinery, Inc, pp. 13-20, 2nd ACM Conference on Electronic Commerce, EC 2000, Minneapolis, United States, 17/10/00. https://doi.org/10.1145/352871.352873

Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics. / Gonen, Rica; Lehmann, Daniel.
EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce. Association for Computing Machinery, Inc, 2000. p. 13-20 (EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal Solutions for Multi-Unit Combinatorial Auctions

T2 - 2nd ACM Conference on Electronic Commerce, EC 2000

AU - Gonen, Rica

AU - Lehmann, Daniel

PY - 2000/10/17

Y1 - 2000/10/17

N2 - Finding optimal solutions for multi-unit combinatorial auc- tions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-and-Bound techniques: they require both a way to bound from above the value of the best allocation and a good criterion to decide which bids are to be tried first. Different methods for e ciently bounding from above the value of the best allocation are considered. Theoretical original results characterize the best approximation ratio and the ordering criterion that provides it. We suggest to use this criterion.

AB - Finding optimal solutions for multi-unit combinatorial auc- tions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-and-Bound techniques: they require both a way to bound from above the value of the best allocation and a good criterion to decide which bids are to be tried first. Different methods for e ciently bounding from above the value of the best allocation are considered. Theoretical original results characterize the best approximation ratio and the ordering criterion that provides it. We suggest to use this criterion.

KW - branch and bound

KW - combinatorial auctions

UR - http://www.scopus.com/inward/record.url?scp=85040831051&partnerID=8YFLogxK

U2 - 10.1145/352871.352873

DO - 10.1145/352871.352873

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85040831051

T3 - EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce

SP - 13

EP - 20

BT - EC 2000 - Proceedings of the 2nd ACM Conference on Electronic Commerce

PB - Association for Computing Machinery, Inc

Y2 - 17 October 2000 through 20 October 2000

ER -

Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this