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
Combinatorial auction-based protocols for resource allocation in grids
Anubhav Das,Daniel Grosu +1 more
TL;DR: A combinatorial auction-based resource allocation protocol in which a user bids a price value for each of the possible combinations of resources required for its tasks execution is proposed.
Journal ArticleDOI
A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach
TL;DR: A novel distributed multi-agent system using auctions based negotiation (DMAS/ABN) approach for resolving the resource conflicts and allocating multiple different types of shared resources amongst multiple competing projects and winner determination problem is solved by efficient new heuristic.
Journal ArticleDOI
Repeated auctions for robust task execution by a robot team
Maitreyi Nanjanath,Maria Gini +1 more
TL;DR: An auction-based algorithm for dynamic allocation of tasks to robots robustness to uncertainties and to robot malfunctions that happen during task execution, enabling the robots to recover from failures and reducing the overall time for task completion is presented.
Journal Article
Truthful randomized mechanisms for combinatorial auctions
TL;DR: In this article, the authors present a new framework for the design of computationally efficient and incentive-compatible mechanisms for combinatorial auctions, which are randomized and obtain incentive compatibility in the universal sense.
Proceedings Article
Some Tractable Combinatorial Auctions
TL;DR: This work introduces polynomial solutions for a variety of non-trivial combinatorsial auctions, such as combinatorial network auctions, various sub-additive combinatorials auctions, and some restricted forms of multi-unit combinatorially auctions.
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.