Sciweavers

149 search results - page 1 / 30
» On Mechanism Design without Payments for Throughput Maximiza...
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
On Mechanism Design without Payments for Throughput Maximization
—It is well-known that the overall efficiency of a distributed system can suffer if the participating entities seek to maximize their individual performance. Consequently, mecha...
Thomas Moscibroda, Stefan Schmid
WINE
2009
Springer
182views Economy» more  WINE 2009»
14 years 1 months ago
Competitive Repeated Allocation without Payments
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) inc...
Mingyu Guo, Vincent Conitzer, Daniel M. Reeves
ATAL
2010
Springer
13 years 8 months ago
Strategy-proof allocation of multiple items between two agents without payments or priors
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
Mingyu Guo, Vincent Conitzer
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 1 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz