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
Collaboration Mechanism in the Horizontal Logistics Collaboration
TL;DR: In this paper, the authors identify two organizational forms of HLC: the centralized and decentralized ones, and propose a collaboration model that is a collaboration conducting process integrating decision-aiding tools to guide the implementation of the collaboration.
Proceedings ArticleDOI
Reduction of economic inequality in combinatorial domains
TL;DR: This work applies inequality criteria to allocation problems with indivisible goods, i.e., to the kind of problem typically analysed in Multiagent Systems, and formulates a generic approach to designing modular algorithms for solving this problem using integer programming.
Proceedings ArticleDOI
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Georg Gottlob,Gianluigi Greco +1 more
TL;DR: The notion of hypertree decomposition, a recently introduced measure of hypergraph cyclicity, turns out to be most useful here and is shown to be solvable in polynomial time on instances whose bidder interactions can be represented with (dual) hypergraphs having bounded hypertree width.
Proceedings Article
Winner Determination in Huge Elections with MapReduce.
TL;DR: This work applies the MapReduce framework – which has been specifically designed for dealing with big data – to various versions of the winner determination problem and obtains efficient and highly parallel algorithms and provides a theoretical analysis and experimental evaluation.
Journal ArticleDOI
A computational model for multi-agent E-commerce negotiations with adaptive negotiation behaviors
Gong Wang,T. N. Wong,Chunxia Yu +2 more
TL;DR: A computational model to organize multi-agent E-commerce negotiations with adaptive negotiation behaviors aiming at enhancing the negotiation flexibilities of software agents and the outcomes show that the adaptive negotiation behavior configuration mechanism can benefit an agent to win more in the E- commerce negotiation.
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.