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
Bounded Approximate Payoff Division for MC-nets Games
Journal ArticleDOI
Digital dividend auction process in Colombia
A price trajectory algorithm for solving iterative auction problems
Peter R. Wurman,Jie Zhong +1 more
TL;DR: This dissertation presents a new approach called the Price Trajectory Algorithm to solve iterative auction problems and presents a cryptographic protocol for the price trajectory algorithm to ensure security.
Proceedings ArticleDOI
Theory of Internet Auctions
TL;DR: An overview of the theory of Internet auctions is shown, explaining the basic terms and concepts used in auction and game theory literature and examining various auction protocols.
Managing Operations in Multiagent Virtual Organizations (Extended Abstract)
TL;DR: A combinatorial auction approach to the initial commitment decision problem determines how a team task can be allocated to a team of agents forming a virtual organization, while taking into consideration that the agents may be of different nature and they have other tasks in addition to the VO tasks.
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.