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
Posted Content

A Practical Solution to Yao's Millionaires' Problem and Its Application in Designing Secure Combinatorial Auction.

TL;DR: This work presents a new solution to the Yao's Millionaires' problem namely, Privacy Preserving Comparison (PPC), and shows that PPC achieves this comparison in constant time as well as in one execution, and demonstrates the significance of PPC.
Journal ArticleDOI

Optimal Set Cover Formulation for Exclusive Row Biclustering of Gene Expression

TL;DR: This paper presents an approach for tuning the threshold of the algorithm based on comparison with a null model, inspired by the Gap statistic approach, and demonstrates its power in identifying large span non-overlapping rows submatrices, while considering their unique nature.
Journal ArticleDOI

Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem

TL;DR: In this paper, the authors consider the optimal allocation problem in combinatorial auctions, where the items are alocated to bidders so that the sum of the utilities is maximized, and show NP-hardness and/or polynomial-time ex act/approximation algorithms.
Proceedings Article

Preference modeling by weighted goals with max aggregation

TL;DR: In this article, the authors consider the properties of several goalbase languages that use max as their aggregation function and examine the expressivity, succinctness and complexity of such languages, in particular, they examine how goalbases are translated into utility functions.
Journal ArticleDOI

Exact algorithms for the matrix bid auction

TL;DR: This paper presents two mathematical programming formulations for the general matrix bid auction winner determination problem and develops two branch-and-price algorithms to solve thewinner determination problem.
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.