Strategy-proof partitioning

Debasis Mishra and Souvik Roy

Games and Economic Behavior, 2012, vol. 76, issue 1, 285-300

Abstract: We consider the problem of choosing a partition of a set of objects by a set of agents. The private information of each agent is a strict ordering over the set of partitions of the objects. A social choice function chooses a partition given the reported preferences of the agents. We impose a natural restriction on the allowable set of strict orderings over the set of partitions, which we call an intermediate domain. Our main result is a complete characterization of strategy-proof and tops-only social choice functions in the intermediate domain. We also show that a social choice function is strategy-proof and unanimous if and only if it is a meet social choice function.

Keywords: Strategy-proof partitioning; Meet social choice function; Intermediate domain (search for similar items in EconPapers)
JEL-codes: D71 (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825612000772
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Strategy-proof partitioning (2011)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:76:y:2012:i:1:p:285-300

DOI: 10.1016/j.geb.2012.05.004

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().