This paper considers the problem of allocating an amount of a perfectly divisible resource among agents. We are interested in rules eliminating the possibility that an agent can compensate another to misrepresent her preferences, making both agents strictly better off. Such rules are said to be bribe-proof (Schummer in J Econ Theory 91:180–198, 2000). We first provide necessary and sufficient conditions for any rule defined on the single-peaked domain to be bribe-proof. By invoking this and Ching’s (Soc Choice Welf 11:131–136, 1994) result, we obtain the uniform rule as the unique bribe-proof and symmetric rule on the single-peaked domain. Furthermore, we examine how large a domain can be to allow for the existence of bribe-proof and symmetric rules and show that the convex domain is such a unique maximal domain.
Social Choice and Welfare – Springer Journals
Published: Jul 7, 2017
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud