scispace - formally typeset
Open AccessJournal ArticleDOI

Algorithm for optimal winner determination in combinatorial auctions

Tuomas Sandholm
- 01 Feb 2002 - 
- Vol. 135, Iss: 1, pp 1-54
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 Article

Issues in multiagent resource allocation

TL;DR: A survey of some of the most salient issues in Multiagent Resource Allocation, including various languages to represent the pref-erences of agents over alternative allocations of resources as well as different measures of social welfare to assess the overall quality of an allocation.
Book

Grid resource management: state of the art and future trends

TL;DR: An introduction to Grid applications and technologies is provided and the important role that resource management will play in future developments is discussed.
Journal Article

Agent-Mediated Electronic Commerce

TL;DR: In this paper, the state of the art of agent-mediated electronic commerce (e-commerce), concentrating particularly on the business-to-consumer (B2C) and businessto-business (b2B) aspects, is surveyed and analyzed.
Proceedings Article

Iterative Combinatorial Auctions: Theory and Practice

TL;DR: iBundle is introduced, the first iterative combinatorial auction that is optimal for a reasonable agent bidding strategy, in this case myopic best-response bidding, and its optimality is proved with a novel connection to primal-dual optimization theory.
Proceedings ArticleDOI

Towards a universal test suite for combinatorial auction algorithms

TL;DR: This paper presents a suite of distribution families for generating realistic, economically motivated combinatorial bids in five broad real-world domains, and hopes that this work will yield many comments, criticisms and extensions, bringing the community closer to a universal combinatorsial auction test suite.
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

Theodore Groves
- 01 Jul 1973 - 
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.