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
Decision Making and Emergency Communication System in Rescue Simulation for People with Disabilities
Kohei Arai,Tran Xuan Sang +1 more
TL;DR: The decision making method to decide which volunteers should help which disabled persons is proposed by utilizing the auction mechanism and the GIS data are used to present the objects in a large-scale disaster simulation environment such as roads, buildings, and humans.
Proceedings ArticleDOI
Auctions with untrustworthy bidders
TL;DR: It is proved that, if the winner is considered to have the trustworthiness of the second-highest bidder, truthfully declaring one's trustworthiness becomes a dominant strategy.
Book ChapterDOI
Super solutions for combinatorial auctions
Alan Holland,Barry O'Sullivan +1 more
TL;DR: This work presents a novel application of super solutions to combinatorial auctions in which a bid may be disqualified or withdrawn after the winners are announced and analyzes the effectiveness of this approach in different auction scenarios that simulate economically motivated bidding patterns.
Dissertation
Agents for logistics: a provisional agreement approach
TL;DR: In this paper, the authors present a list of FIGURE FIGURES, ACKNOWLEDGEMENTS, and TABLES for the first chapter of a book entitled "Declaration of Declarative Declarations".
Dissertation
GeNCA : un modele general de negociation de contrats entre agents
TL;DR: In this article, the authors propose a generic negotiation of contracts API (GeNCA) for negociation, which is based on the concept of negociations of points communs.
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.