Sciweavers

15 search results - page 3 / 3
» Failures of the VCG mechanism in combinatorial auctions and ...
Sort
View
FOCS
2005
IEEE
13 years 11 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 5 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
ATAL
2004
Springer
13 years 9 months ago
Anonymous Pricing of Efficient Allocations in Combinatorial Economies
Auctions and exchanges are important coordination mechanisms for multiagent systems. Most multi-good markets are combinatorial in that the agents have preferences over bundles of ...
Wolfram Conen, Tuomas Sandholm
AMEC
2004
Springer
13 years 10 months ago
Specifying and Monitoring Market Mechanisms Using Rights and Obligations
Abstract. We provide a formal scripting language to capture the semantics of market mechanisms. The language is based on a set of welldefined principles, and is designed to captur...
Loizos Michael, David C. Parkes, Avi Pfeffer
ATAL
2010
Springer
13 years 6 months ago
False-name-proofness with bid withdrawal
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
Mingyu Guo, Vincent Conitzer