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
Dissertation
Organizing adaptation using agents in serious games
TL;DR: In this article, the authors propose a framework to adjust the difficulty of computer games according to the skill level of the user on the fly, by dividing the game in small parts and measuring the performance of the player on every part that is finished.
Journal ArticleDOI
Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization
Tuomas Sandholm,David I. Levine,Michael Concordia,Paul Martyn,Rick Hughes,James Jacobs,Dennis Begg +6 more
TL;DR: Procter & Gamble put into practice CombineNets approach to building sourcing networks, called expressive competition, a vision that looks past lowest-price reverse auctions and combinatorial package bidding toward a highly expressive commerce relationship with suppliers.
Book
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms
TL;DR: This book provides comprehensive coverage of the primary exact algorithms for reasoning with graphical models, and believes the principles outlined here would serve well in moving forward to approximation and anytime-based schemes.
Journal ArticleDOI
An online mechanism for multi-unit demand and its application to plug-in hybrid electric vehicle charging
Valentin Robu,Enrico H. Gerding,Sebastian Stein,David C. Parkes,Alex Rogers,Nicholas R. Jennings +5 more
TL;DR: Using data from a real-world trial of PHEVs in the UK, higher system performance than a fixed price system, performance comparable with a standard, but non-truthful scheduling heuristic, and the ability to support 50% more vehicles at the same fuel cost than a simple randomized policy are demonstrated.
Proceedings ArticleDOI
Limitations of VCG-based mechanisms
Shahar Dobzinski,Noam Nisan +1 more
TL;DR: For combinatorial auctions among submodular (and thus also subadditive) bidders, an Ω(m1/6) lower bound is proved, which is close to the known upper bound of O( m1/2), and qualitatively higher than the constant factor approximation possible from a purely computationalpoint of view.
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.