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
Augmenting Local Search for Satisfiability
TL;DR: Two new local search methods are proposed and tested, the first, SDF, demonstrating the value of the insights drawn from the metrics, and the second, ESG, achieving state-of-the-art performance and generalizing the approach to arbitrary 0-1 integer linear programming problems.
Book ChapterDOI
Standard Single-Unit Auctions
Asuncion Mochon,Yago Saez +1 more
TL;DR: In this article, the authors discuss the standard single unit auctions: ascending (English), descending (Dutch), first-price sealed-bid, and second price sealed bid, and the equivalences among them are mentioned.
Journal ArticleDOI
A Negotiation Method Based on Opportunity Cost in the Trucking Cargo Transportation Market
Hyun-Chul Kim,Jae-Hyung Cho +1 more
TL;DR: This study has tried to prove that the result of an agent-based negotiation is the Pareto optimal solution under the present market environment by analysing e-Marketplace, structure of shipping expenses and brokerage system in the trucking cargo transportation industry.
Book ChapterDOI
Query trading in digital libraries
TL;DR: This paper model the task of query optimization and execution as a task of trading CPU-processing, queries and query-answers, and shows that this framework satisfies the needs of modern DL federations by respecting the autonomy of DL nodes and natively supporting their business model.
Lectures on Combinatorial Auctions
TL;DR: These are lecture notes for one third of the class CS364B, Topics in Algorithmic Game Theory, offered at Stanford University in the Fall 2005 term, covering the topic of combinatorial auctions, with an undeniably strong bias toward recent work by the “STOC/FOCS” (algorithms and complexity) community.
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.