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
Journal ArticleDOI
A tractable multiple agents protocol and algorithm for resource allocation under price rigidities
TL;DR: This work investigates the computational issues of dynamic mechanisms for selling multiple indivisible objects under price rigidities, and proposes a multiple agents protocol and algorithm with polynomial time complexity that can achieve the over-demanded sets of items and introduces a dynamic mechanism with rationing to discover constrainedWalrasian equilibria.
Posted Content
Egalitarian Negotiations in Agent Societies
TL;DR: This study seeks to provide an evenly distributed approach based on a multiagent system, which overcomes the main drawbacks of centralized approaches and provides an adaptive, anytime, and scalable algorithm to hold efficient egalitarian negotiations.
Pyragrid: Bringing Peer-to-Peer and Grid Architectures Together.
TL;DR: The Pyragrid architecture is presented, a novel distributed database system that borrows the principle of locating data used in a peer-to-peer system and extends it to more complex functionality and types of processing.
Journal ArticleDOI
Average-case analysis of VCG with approximate resource allocation algorithms
Yevgeniy Vorobeychik,Yagil Engel +1 more
TL;DR: An important consequence of the analysis is an argument that using state-of-the-art algorithms for solving combinatorial allocation problems essentially eliminates agent incentives to lie.
Book ChapterDOI
Modeling negotiation in combinatorial auctions based on multi-agent
Man-Yin Shi,Shan-Li Hu +1 more
TL;DR: This paper presents a negotiation model which is based on the multi-agent, and gives the basic characteristics and the satisfied conditions of winner determination which is determined by the solution of Nash negotiation and indicates the rationality and fairness of this method.
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.