Sciweavers

64 search results - page 13 / 13
» On Low-Envy Truthful Allocations
Sort
View
AAAI
2000
13 years 7 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
ATAL
2006
Springer
13 years 9 months ago
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...
Tuomas Sandholm, Andrew Gilpin
AAAI
2008
13 years 8 months ago
Partially Synchronized DEC-MDPs in Dynamic Mechanism Design
In this paper, we combine for the first time the methods of dynamic mechanism design with techniques from decentralized decision making under uncertainty. Consider a multi-agent s...
Sven Seuken, Ruggiero Cavallo, David C. Parkes
IJCAI
2001
13 years 7 months ago
Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges
Generalized Vickrey mechanisms have received wide attention in the literature because they are efficient and strategyproof, i.e. truthful bidding is optimal whatever the bids of o...
David C. Parkes, Jayant Kalagnanam, Marta Eso