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
A Combinatorial Auction Mechanism for Multiple Resource Procurement in Cloud Computing
TL;DR: Simulations using the design of the cloud algorithm with prices procured from several cloud vendors’ datasets show its effectiveness at multiple resource procurement.
Computational aspects of preference aggregation
Tuomas Sandholm,Vincent Conitzer +1 more
TL;DR: This thesis statement is that the study of computational aspects of the mechanism design process can significantly improve the generated mechanisms in a hierarchy of ways, leading to better outcomes (and a more efficient process).
Journal Article
Generalized Knapsack Solvers for Multi-unit Combinatorial Auctions : Analysis and Application to Computational Resource Allocation
TL;DR: In this paper, the problem of computing optimal (surplus-maximizing) allocations, assuming unrestricted quasi-linear preferences, is considered, and a pseudo-polynomial time and memory requirements are linear in three of four natural measures of problem size: number of agents, length of bids, and units of each resource.
Journal ArticleDOI
Optimal bidding in auctions from a game theory perspective
TL;DR: This research traces key recent advances, which have greatly expanded the understanding of the operation of auctions and produced a more accurate analysis of mechanism design and optimal bidding, and identifies important innovations, which expand the environment of auction bidding and carry us beyond rational decision making.
Posted Content
Combinatorial Auctions with Restricted Complements
TL;DR: In this paper, a model for combinatorial auctions with complements is proposed, where a valuation in the model is represented succinctly by a weighted hypergraph, where the size of the hyper-edges corresponds to degree of complementarity.
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.