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
Multi-objective optimization in graphical models
TL;DR: Many real-life optimization problems are combinatorial, i.e. they concern a choice of the best solution from a finite but exponentially large set of alternatives and several notions of optimality have been proposed.
Journal ArticleDOI
Biased random-key genetic algorithms for the winner determination problem in combinatorial auctions
TL;DR: This paper addresses the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model and introduces six variants of biased random-key genetic algorithms for this problem.
Proceedings Article
A faster core constraint generation algorithm for combinatorial auctions
TL;DR: A new algorithm is presented that significantly outperforms the current state of the art in fast algorithms for computing core prices in large combinatorial auctions by exploiting separability in allocative conflicts between participants in the auction and leveraging non-optimal solutions.
Book ChapterDOI
Lazy auctions for multi-robot collision avoidance and motion control under uncertainty
TL;DR: An auction-flavored multi-robot planning mechanism where coordination is to be achieved on the occupation of atomic resources modeled as binary inter-ro Bot constraints is presented, offering a decentralized, auction-based alternative to previously established centralized approaches for multi- robot open-loop control.
Journal ArticleDOI
A two-stage stochastic winner determination model integrating a hybrid mitigation strategy for transportation service procurement auctions
TL;DR: Comparison analysis indicates that this revised winner determination problem with disruption risks of bidders for a fourth party logistics provider to purchase transportation services via combinatorial reverse auctions is better than some known strategies, and would have a more significant influence on cost minimization of the 4PL as the probability of disruption becomes higher.
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.