Coexistence of utilitarian efficiency and false-name-proofness in social choice
نویسندگان
چکیده
The class of Groves mechanisms has been attracting much attention in mechanism design literature due to two attractive characteristics: utilitarian efficiency (also called social welfare maximization) and dominant strategy incentive compatibility. However, when strategic agents can create multiple fake identities and reveal more than one preference under them, a refined characteristic called false-name-proofness is required. Utilitarian efficiency and false-name-proofness are incompatible in combinatorial auctions, if we also have individual rationality as a desired condition. However, although individual rationality is strongly desirable, if participation is mandatory due to social norms or reputations, a mechanism without individual rationality can be sustained. In this paper we investigate the relationship between utilitarian efficiency and false-name-proofness in a social choice environment with monetary transfers. We show that in our modelization no mechanism simultaneously satisfies utilitarian efficiency, false-name-proofness, and individual rationality. Considering this fact, we ignore individual rationality and design various mechanisms that simultaneously satisfy the other two properties. We also compare our different mechanisms in terms of the distance to individual rationality. Finally we illustrate our mechanisms on a facility location problem.
منابع مشابه
Optimal false-name-proof single-item redistribution mechanisms
Although the celebrated Vickrey auction is strategy-proof and guaranteed to achieve an efficient allocation in a singleobject auction, if there exists no outside party (i.e., a seller or an auctioneer) with the right to collect the payment, the collected payment will be wasted. Redistribution mechanisms try to redistribute the payment to participating agents as much as possible without violatin...
متن کامل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 been decided, withdraw some of her false-name identities (have some of her falsename identities refuse to pay). While these withdrawn identities will not obtain the items they won, their initial presence may have been ben...
متن کاملStrategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods
We study resource allocation in a model due to Brams and King [2005] and further developed by Baumeister et al. [2014]. Resource allocation deals with the distribution of resources to agents. We assume resources to be indivisible, nonshareable, and of single-unit type. Agents have ordinal preferences over single resources. Using scoring vectors, every ordinal preference induces a utility functi...
متن کاملImpossibilities for probabilistic assignment
We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...
متن کاملStrategy-Proofness of Scoring Allocation Correspondences
We study resource allocation in a model due to Brams and King [2005] and further developed by Baumeister et al. [2014]. Resource allocation deals with the distribution of resources to agents. We assume resources to be indivisible, nonshareable, and of single-unit type. Agents have ordinal preferences over single resources. Using scoring vectors, every ordinal preference induces a utility functi...
متن کامل