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
Book
Algorithmic Game Theory
TL;DR: A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior in a bid to solve the challenges of 21st Century finance.
Book
Combinatorial Auctions
TL;DR: It's important for you to start having that hobby that will lead you to join in better concept of life and reading will be a positive activity to do every time.
Journal ArticleDOI
Combinatorial Auctions: A Survey
Sven de Vries,Rakesh Vohra +1 more
TL;DR: The state of knowledge about the design of combinatorial auctions is surveyed and some new insights are presented.
Journal ArticleDOI
Market-Based Multirobot Coordination: A Survey and Analysis
TL;DR: An introduction to market-based multirobot coordination is provided, a review and analysis of the state of the art in the field, and a discussion of remaining research challenges are discussed.
Journal ArticleDOI
Consensus-Based Decentralized Auctions for Robust Task Allocation
TL;DR: This paper addresses task allocation to coordinate a fleet of autonomous vehicles by presenting two decentralized algorithms: the consensus-based auction algorithm (CBAA) and its generalization to the multi-assignment problem, i.e., theensus-based bundle algorithm ( CBBA).
References
More filters
Journal ArticleDOI
The Set-Partitioning Problem: Set Covering with Equality Constraints
TL;DR: This paper gives an enumerative algorithm for the set-partitioning problem, that is, theset-covering problem with equality constraints, and presents computational results for real and randomly generated problems.
Journal ArticleDOI
Approximations of Weighted Independent Set and Hereditary Subset Problems
TL;DR: In this paper, the authors report improved performance ratios for the Independent Set problem in weighted general graphs, weighted bounded-degree graphs, and in sparse graphs with better than previously reported ratios for Weighted Set Packing, Longest Subsequence, Maximum Independent Sequence, and Independent Set in hypergraphs.
Journal ArticleDOI
A Combinatorial Auction with Multiple Winners for Universal Service
Frank Kelly,Richard Steinberg +1 more
TL;DR: In this article, a discrete-time auction procedure called PAUSE (Progressive Adaptive User Selection Environment) is described for assigning COLR (Carrier of Last Resort) responsibility for universal service.
Journal ArticleDOI
Multi-object auctions: sequential vs. simultaneous sales
TL;DR: In this article, the authors studied whether a seller would prefer to sell multiple objects through sequential or simultaneous auctions and found that the seller sometimes prefer simultaneous sales and sometimes prefer sequential sales.
Proceedings Article
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Tuomas Sandholm,Subhash Suri +1 more
TL;DR: A more sophisticated search algorithm for optimal (and anytime) winner determination is presented, including structural improvements that reduce search tree size, faster data structures, and optimizations at search nodes based on driving toward, identifying and solving tractable special cases.