Sciweavers

22 search results - page 1 / 5
» Truth Revelation in Approximately Efficient Combinatorial Au...
Sort
View
CORR
2002
Springer
82views Education» more  CORR 2002»
13 years 4 months ago
Truth Revelation in Approximately Efficient Combinatorial Auctions
Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham
ATAL
2004
Springer
13 years 9 months ago
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...
Benoît Hudson, Tuomas Sandholm
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
13 years 9 months ago
Differential-revelation VCG mechanisms for combinatorial auctions
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
Wolfram Conen, Tuomas Sandholm
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 4 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
ICALP
2010
Springer
13 years 6 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier