Characterizing Vickrey allocation rule by anonymity
We consider the problem of allocating finitely many units of an indivisible good among a group of agents when each agent receives at most one unit of the good and pays a non-negative price. For example, imagine that a government allocates a fixed number of licenses to private firms, or that it distr...
Main Authors: | Ashlagi, Itai, Serizawa, Shigehiro |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | en_US |
Published: |
Springer-Verlag
2011
|
Online Access: | http://hdl.handle.net/1721.1/64927 https://orcid.org/0000-0003-2124-738X |
Similar Items
-
Knightian Analysis of the Vickrey Mechanism
by: Chiesa, Alessandro, et al.
Published: (2016) -
Optimal Lower Bounds for Anonymous Scheduling Mechanisms
by: Ashlagi, Itai, et al.
Published: (2014) -
Anonymous reputation system
by: Chua, Wei Kiat
Published: (2017) -
Spectral anonymization of data
by: Lasko, Thomas A. (Thomas Anton), 1965-
Published: (2008) -
Who controls anonymity? Control point analysis of the Onion routing anonymity network (TOR)
by: Rady, Mina
Published: (2022)