Proceedings Article10.1109/ICMAS.2000.858429
Integer programming for combinatorial auction winner determination
Arne Andersson,M. Tenhunen,Fredrik Ygge +2 more
- 10 Jul 2000
- pp 39-46
TL;DR: This paper compares recent algorithms for winner determination to traditional algorithms, and presents and benchmark a mixed integer programming approach to the problem, which enables very general auctions to be treated efficiently by standard integer programming algorithms.
read more
Abstract: Combinatorial auctions are important as they enable bidders to place bids on combinations of items. Compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping low risks for bidders. However, the determination of an optimal winner combination in combinatorial auctions is a complex computational problem. In this paper we: 1) compare recent algorithms for winner determination to traditional algorithms; 2) present and benchmark a mixed integer programming approach to the problem, which enables very general auctions to be treated efficiently by standard integer programming algorithms (and hereby also by commercially available software); and 3) discuss the impact of the probability distributions chosen for benchmarking.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Combinatorial Auctions: A Survey
Sven de Vries,Rakesh Vohra +1 more
TL;DR: The state of knowledge about the design of combinatorial auctions is surveyed and some new insights are presented.
Consensus-Based Decentralized Auctions for Robust Task Allocation
TL;DR: This paper addresses task allocation to coordinate a fleet of autonomous vehicles by presenting two decentralized algorithms: the consensus-based auction algorithm (CBAA) and its generalization to the multi-assignment problem, i.e., theensus-based bundle algorithm ( CBBA).
Auction Protocols for Decentralized Scheduling
TL;DR: This work formalizes decentralized scheduling as a discrete resource allocation problem, and brings to bear some relevant economic concepts about the existence of equilibrium prices for some general classes of scheduling problems, and the quality of equilibrium solutions.
537
Combinatorial Auctions
Peter Cramton,Yoav Shoham,Richard Steinberg +2 more
- 09 Dec 2005
TL;DR: This paper discusses several complex issues that are encountered in the design of combinatorial auctions related to the formulation of the winner determination problem, the expression of combined bids, the design of progressive combinatorial auctions that require less information revelation, and the need for decision support tools to help participants make profitable bidding decisions.
516
Towards a universal test suite for combinatorial auction algorithms
Kevin Leyton-Brown,Mark Pearson,Yoav Shoham +2 more
- 17 Oct 2000
TL;DR: This paper presents a suite of distribution families for generating realistic, economically motivated combinatorial bids in five broad real-world domains, and hopes that this work will yield many comments, criticisms and extensions, bringing the community closer to a universal combinatorsial auction test suite.
References
Algorithm for optimal winner determination in combinatorial auctions
TL;DR: The algorithm allows combinatorial auctions to scale up to significantly larger numbers of items and bids than prior approaches to optimal winner determination by capitalizing on the fact that the space of bids is sparsely populated in practice.
1.1K
Computationally Manageable Combinational Auctions
TL;DR: In this paper, the problem of determining the revenue maximizing set of nonconflicting bids can be solved for combinational auctions where the value of assets to a bidder depends on which other assets he or she wins.
RBPDB: a database of RNA-binding specificities
TL;DR: The RNA-Binding Protein DataBase (RBPDB) is a collection of experimental observations of RNA-binding sites, both in vitro and in vivo, manually curated from primary literature, which contains binding data on 272 RBPs.
1.1K
A Combinatorial Auction Mechanism for Airport Time Slot Allocation
TL;DR: Grether, Isaac, and Plott as discussed by the authors proposed an auction-based approach for the allocation of slots at four major airports (La Guardia, Washington National, Kennedy International, and O'Hare International).
774
•Proceedings Article
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
Yuzo Fujishima,Kevin Leyton-Brown,Yoav Shoham +2 more
- 31 Jul 1999
TL;DR: This work proposes two methods of overcoming apparent intractability in combinatorial auctions by structuring the search space so that a modified depth-first search usually avoids even considering allocations that contain conflicting bids.