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
A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
Ali Haydar Özer,Can Özturan +1 more
TL;DR: This paper introduces yet another variant of CAP which generalizes the multi- unit CAP further to allow bids on collections of items that can come from bidder defined classes of items, and calls this problem multi-unit nondiscriminatory combinatorial auction (MUNCA).
Journal ArticleDOI
A Balanced Heuristic Mechanism for Multirobot Task Allocation of Intelligent Warehouses
TL;DR: A balanced heuristic mechanism (BHM) is proposed for the multirobot task allocation problem in intelligent warehouses, where a team of mobile robots are expected to efficiently transport a number of given objects.
Proceedings ArticleDOI
Limited verification of identities to induce false-name-proofness
TL;DR: This paper characterize when such a limited verification protocol induces false-name-proofness for a mechanism, that is, when the combination of the mechanism and the verification protocol gives the agents no incentive to use multiple identifiers.
Proceedings Article
Computational Mechanism Design
TL;DR: In constructing mechanisms, with application to the design of electronic markets and to protocols for automated negotiation, many new issues arise in resolving tensions between incentive, computation and communication constraints.
Journal ArticleDOI
A test suite for the evaluation of mixed multi-unit combinatorial auctions
Meritxell Vinyals,Andrea Giovannucci,Jesús Cerquides,Pedro Meseguer,Juan A. Rodríguez-Aguilar +4 more
TL;DR: This paper tries to make headway on the practical application of MMUCAs by providing an algorithm to generate artificial data that is representative of the sort of scenarios a winner determination algorithm is likely to encounter and subsequently assessing the performance of an Integer Programming implementation of MMUCA in CPLEX.
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.