Sciweavers

11 search results - page 2 / 3
» Differential-revelation VCG mechanisms for combinatorial auc...
Sort
View
SAGT
2009
Springer
118views Game Theory» more  SAGT 2009»
13 years 11 months ago
A Modular Approach to Roberts' Theorem
Roberts’ theorem from 1979 states that the only incentive compatible mechanisms over a full domain and range of at least 3 are weighted variants of the VCG mechanism termed affin...
Shahar Dobzinski, Noam Nisan
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 4 months ago
Fairness in Combinatorial Auctioning Systems
One of the Multi-Agent Systems that is widely used by various government agencies, buyers and sellers in a market economy, in such a manner so as to attain optimized resource allo...
Megha Saini, Shrisha Rao
ATAL
2003
Springer
13 years 10 months ago
Generalizing preference elicitation in combinatorial auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
FOCS
2005
IEEE
13 years 10 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
AIR
2004
111views more  AIR 2004»
13 years 4 months ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan