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
Proceedings ArticleDOI
A winner determination algorithm for auction-based decentralized scheduling
TL;DR: Experiments show that the proposed algorithm is more than an order of magnitude faster on average over a set of winner determination problems of decentralized scheduling generated based on a suite of job shop constraint satisfaction benchmark problems previously developed in the literature.
Exploiting Structure in CSP-related Problems
TL;DR: This thesis investigates the computational complexity and approximability of computational problems from the constraint satisfaction framework and finds an instance of a constraint satisfaction problem that meets these criteria.
Journal ArticleDOI
Algorithms as mechanisms: the price of anarchy of relax-and-round
TL;DR: It is shown that algorithms that follow the relax-and-round paradigm translate approximation guarantees into Price of Anarchy guarantees, provided that the rounding is oblivious and the relaxation is smooth.
Journal ArticleDOI
Iterative combinatorial auctions for managing product transitions in semiconductor manufacturing
TL;DR: Computational results show that the ICA that uses column generation to update prices outperforms that using subgradient search, obtaining near-optimal corporate profit in low CPU times.
Proceedings ArticleDOI
Keeping the trainee on track
TL;DR: An architecture for game design is proposed that introduces a monitoring module to check the development of user skills and direct coordinated agent adaptation.
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.