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
eMediator: A Next Generation Electronic Commerce Server
TL;DR: This paper presents eMediator, an electronic commerce server prototype that demonstrates ways in which algorithmic support and game–theoretic incentive engineering can jointly improve the efficiency of e–commerce.
Proceedings Article
Greedy local improvement and weighted set packing approximation
TL;DR: In this paper, the authors present an approximation algorithm for the weighted k-set packing problem that combines the two paradigms by starting with an initial greedy solution and then repeatedly choosing the best possible local improvement.
Journal ArticleDOI
Leveled Commitment Contracts and Strategic Breach
Tuomas Sandholm,Victor Lesser +1 more
TL;DR: It is shown that, despite such strategic breach, leveled commitment increases the expected payoff to both contract parties and can enable deals that are impossible under full commitment.
Journal ArticleDOI
Issues in computational Vickrey auctions
TL;DR: Methods for determining winners and prices in combinatorial"second-price” auctions are treated, together with the implications for truth dominance.
Book ChapterDOI
Approximations of weighted independent set and hereditary subset problems
TL;DR: Improved performance ratios for the Independent Set problem in weighted general graphs, weighted bounded-degree graphs, and in sparse graphs are reported.