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
Proceedings ArticleDOI
Combinatorial auctions with decreasing marginal utilities
TL;DR: While it is shown that the allocation problem among valuations with decreasing marginal utilities is NP-hard, an efficient greedy 2-approximation algorithm is presented for this case because no such approximation algorithm exists in a setting allowing for complementarities.
Journal ArticleDOI
On agent-mediated electronic commerce
TL;DR: The roles of agents in B2C and B2B e-commerce are identified through the business-to-business transaction model that identifies agents as being employed in partnership formation, brokering, and negotiation.
Proceedings Article
Rational and convergent learning in stochastic games
Michael Bowling,Manuela Veloso +1 more
TL;DR: This paper introduces two properties as desirable for a learning agent when in the presence of other learning agents, namely rationality and convergence, and contributes a new learning algorithm, WoLF policy hillclimbing, that is proven to be rational.
Proceedings ArticleDOI
A General Framework for Wireless Spectrum Auctions
TL;DR: This work proposes a real-time spectrum auction framework to distribute spectrum among a large number wireless users under interference constraints and concludes that bidding behaviors and pricing models have significant impact on auction outcomes.
Journal ArticleDOI
A New and Improved Design for Multiobject Iterative Auctions
TL;DR: A new improved design for multiobject auctions is presented and the results of experimental tests demonstrate that the RAD auction achieves higher efficiencies, lower bidder losses, higher net revenues, and faster times to completion without increasing the complexity of a bidder's problem.
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.