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
Knowledge and games : theory and implementation
TL;DR: In this paper, the authors propose a method to solve the problem of "uniformity" and "uncertainty" in the context of health care, and propose a solution.
Proceedings ArticleDOI
Testing BOI and BOB Algorithms for Solving the Winner Determination Problem in Radio Spectrum Auctions
TL;DR: This paper tackles the computational problem of determining the winner bids among many options in a combinatorial first-price sealed bid auction using two approaches, an A* based on items and a BOB based on bids.
Journal ArticleDOI
Expressive markets for donating to charities
Vincent Conitzer,Tuomas Sandholm +1 more
TL;DR: This paper introduces a bidding language for expressing very general types of matching offers over multiple charities, and forms the corresponding clearing problem, and shows that it cannot be approximated to any ratio in polynomial time unless P=NP, even in very restricted settings.
Proceedings ArticleDOI
An Abstraction-Refinement Methodology for Reasoning about Network Games.
TL;DR: This work describes an abstraction-refinement methodology for reasoning about NGs that maps the state space of an NG to a much smaller state space and searches for a global optimum and a Nash equilibrium by reasoning on an under and an overapproximation defined on top of this larger state space.
Book ChapterDOI
Self-adaptation in Collective Self-aware Computing Systems
Jeffrey O. Kephart,Ada Diaconescu,Holger Giese,Anders Robertsson,Tarek Abdelzaher,Peter R. Lewis,Antonio Filieri,Lukas Esterle,Sylvain Frey +8 more
TL;DR: The techniques available for dealing with the challenges involved in self-adaptation of multiple self-aware systems (or system collectives) are discussed, and which are appropriate given assumptions regarding the collective system architecture are identified.
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.