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 Article
GROWRANGE: anytime VCG-based mechanisms
TL;DR: This work introduces anytime mechanisms for distributed optimization with self-interested agents that retain good incentive properties even when interrupted before the optimal solution is computed, and provide better quality solutions when given additional time.
Proceedings Article
Minimising undesired task costs in multi-robot task allocation problems with in-schedule dependencies
Bradford Heap,Maurice Pagnucco +1 more
TL;DR: This work modified the winner determination phase of sequential single-item auctions to identify tasks which robots collectively consider to be high cost and ensures these tasks are allocated prior to other tasks, and shows a significant reduction in the total time required to complete all tasks.
Journal ArticleDOI
Modelling industrial construction operations using a multi‐agent resource allocation framework
Yang Liu,Yasser Helmy Mohamed +1 more
TL;DR: In this paper, a structured approach for representing resources and their allocation to different activities through the use of an agent-oriented modelling framework is presented. But the model is not suitable for the real case of assembly operations of industrial construction modules.
Book ChapterDOI
Efficient Winner Determination Techniques for Internet Multi-Unit Auctions
TL;DR: This paper proposes that at most N “potential winner bids” amongst the previously submitted bids need to be used for such updates, thus significantly reducing the computation time and memory requirements when a large number of auctions are being conducted simultaneously.
Proceedings ArticleDOI
A desired load distribution model for agent-based distributed scheduling
TL;DR: A generic mathematical model of load distribution for resource allocation, called desired load distribution, is presented to develop a model that can be utilized for classical resource management settings as well as a model for a many-to-many optimized market setting.
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.