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
Winner determination problem with purchase budget for transportation procurement under uncertain shipment volume
TL;DR: In this paper , a winner determination problem (WDP) with purchase budget was studied to mitigate both the probability and magnitude of cost overrun, and the Essential Riskiness Index (Zhang et al., 2019) was introduced as the decision criterion.
Book ChapterDOI
Solids: a combinatorial auction for a housing corporation
TL;DR: The development of this auction for housing space in a newly erected building in Amsterdam (the Netherlands) is described and it is shown how various municipal and building regulations can be included in an integer program that is used to solve the winner determination problem.
A Learning-Based Approach to Combinatorial Optimization
TL;DR: Stochastic greedy algorithms (SGA) incorporates the novel idea of learning from optimal solutions, inspired by data-mining and other learning approaches, and consistently produces solutions significantly closer to optimal than standard greedy approaches.
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.