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
Posted Content
Complexity Results about Nash Equilibria
Vincent Conitzer,Tuomas Sandholm +1 more
TL;DR: A single reduction demonstrates NP- hardness of determining whether Nash equilibria with certain natural properties exist, and demonstrates the NP-hardness of counting NashEquilibria (or connected sets of Nash Equilibria).
Journal ArticleDOI
Market-based Multirobot Coordination for Complex Tasks
Robert Zlot,Anthony Stentz +1 more
TL;DR: The complex task allocation problem is described and a distributed solution for efficiently allocating a set of complex tasks among a robot team is presented and a comparison of the approach with existing task allocation algorithms in this application domain is demonstrated.
Proceedings Article
Complexity results about Nash equilibria
Vincent Conitzer,Tuomas Sandholm +1 more
TL;DR: In this paper, it was shown that determining whether a pure-strategy Bayes-Nash equilibrium exists in a stochastic Markov game is NP-hard even if the game is invisible.
Proceedings ArticleDOI
Approximation algorithms for combinatorial auctions with complement-free bidders
TL;DR: Three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders are exhibited and lower bounds on the possible approximations achievable for these classes of bidder are proved.
Computational Social Choice
Felix Brandt,Ulle Endriss +1 more
TL;DR: The Gibbard-Satterthwaite Impossibility and Computational Hardness of Manipulation as mentioned in this paper are two of the main obstacles in voting rule-based election process, and they have been studied extensively in the literature.
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.