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
Dissertation
A Feature-based Comparison of the Centralised versus Market-based Decision Making under Lens of Environment Uncertainty: Case of the Mobile Task Allocation Problem
TL;DR: In this paper, the authors propose a novel approach to solve the problem of homonymity in homonym-based homonym identification.1 Chapter 1, Section 3.1.
Proceedings ArticleDOI
Revaluation of Bundles by Bidders in Combinatorial Auctions
TL;DR: In this paper, a multi-round package bidding scheme called RevalBundle is proposed, which, at the end of each round, provides bidders with information to help them modify and resubmit their valuations.
Journal ArticleDOI
Combinatorial auctions with tractable winner determination
Georg Gottlob,Gianluigi Greco +1 more
TL;DR: The work of [Gottlob and Greco 2007] is illustrated, where a research question raised in [Conitzer et al. 2004] is solved by showing that the class of structured item graphs is not efficiently recognizable.
Proceedings ArticleDOI
Combinatorial auction across independent markets [Extended Abstract]
Ning Chen,Xiaotie Deng,Hong Zhu +2 more
TL;DR: The complexity for the existence of Walrasian equilibrium of combinatorial auction is established and incentive compatible mechanism that prices individual goods of single-minded auction is considered, improving the previous work on pricing bundles.
Tractable Combinatorial Auctions Via Graph Matching
TL;DR: The set of known tractable combinatorial auctions identified by Tennenholtz is extended to accommodate subadditive symmetric bids over bundles of unlimited size, certain restricted cases of asymmetric discounts over bundles, and certainrestricted cases of superadditive bids.
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.