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 ArticleDOI

Development of efficient combinatorial auction mechanism for airport slot allocation

TL;DR: In this article, the authors developed a model and proposed a mechanism that could overcome the shortcomings of the existing auctioning procedures by incorporating the concepts of welfare issues with due consideration given to the flight capacity to effectively allot the slots.

A principled methodology for the design of autonomous trading agents with combinatorial preferences in the presence of tradeoffs

TL;DR: In this article, the authors present a methodology for designing trading agents, and deciding their bidding strategy, when they participate in a large number of simultaneous auctions with a variety of rules, using a modular, adaptive, scalable and robust agent architecture, combining principled methods and empirical knowledge.
Journal ArticleDOI

Simplified Bidding and Solution Methodology for Truckload Procurement and Other VCG Combinatorial Auctions

TL;DR: In this article, the authors propose to embed the true-cost function directly within the winner-determination problem, using the strength of mathematical programming to solve this problem without ever explicitly enumerating the bids.
Journal ArticleDOI

Micro-economics based resource allocation in Grid-Federation environment

TL;DR: It is shown that in a Walrasian equilibrium, the Grid Federation market reaches an efficient resource allocation and a computationally tractable mechanism is proposed.
Journal ArticleDOI

Experimental analysis of optimization techniques on the road passenger transportation problem

TL;DR: This paper experimentally analyzed a set of representative state-of-the-art techniques in the problem the authors are dealing with, namely, the road passenger transportation problem, an optimization problem in which drivers should be assigned to transport services, fulfilling some constraints and minimizing some function cost.
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.