Algorithm for optimal winner determination in combinatorial auctions
Reads0
Chats0
TLDR
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.About:
This article is published in Artificial Intelligence.The article was published on 2002-02-01 and is currently open access. It has received 1045 citations till now. The article focuses on the topics: Combinatorial auction & Common value auction.read more
Citations
More filters
Journal ArticleDOI
Auctions and bidding: A guide for computer scientists
TL;DR: This article surveys the literature on auctions from a computer science perspective, primarily from the viewpoint of computer scientists interested in learning about auction theory, and provides pointers into the economics literature for those who want a deeper technical understanding.
Journal ArticleDOI
Iterative and core-guided MaxSAT solving: A survey and assessment
TL;DR: A survey of MaxSAT algorithms based on iteratively calling a SAT solver and a comprehensive empirical study on non-random benchmarks are conducted, indicating that core-guided MaxS AT algorithms are fairly competitive compared to other approaches.
Journal ArticleDOI
Energy-Efficient Resource Allocation for Device-to-Device Underlay Communication
TL;DR: An iterative combinatorial auction algorithm is introduced, where the D2D users are considered bidders that compete for channel resources and the cellular network is treated as the auctioneer to improve the energy efficiency of user equipments.
Proceedings ArticleDOI
A combinatorial auction for collaborative planning
Luke Hunsberger,Barbara J. Grosz +1 more
TL;DR: A mechanism that agents may use to solve the initial-commitment decision problem is described, based on a combinatorial auction in which agents bid on sets of roles in the group activity, each role comprising constituent subtasks that must be done by the same agent.
Proceedings ArticleDOI
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Rica Gonen,Daniel Lehmann +1 more
TL;DR: In this article, the authors investigate the use of Branch-and-Bound techniques for multi-unit combinatorial auctions and show that 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.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Book
Integer programming
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
Journal ArticleDOI
Incentives in Teams
TL;DR: This paper analyzes the problem of inducing the members of an organization to behave as if they formed a team and exhibits a particular set of compensation rules, an optimal incentive structure, that leads to team behavior.