Advanced Search
MyIDEAS: Login

Strategy-proof partitioning

Contents:

Author Info

  • Debasis Mishra

    () (Indian Statistical Institute, New Delhi)

  • Souvik Roy

    (University of Caen)

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://www.isid.ac.in/~pu/dispapers/dp11-06.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Indian Statistical Institute, New Delhi, India in its series Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers with number 11-06.

as in new window
Length: 27 pages
Date of creation: Jun 2011
Date of revision:
Handle: RePEc:ind:isipdp:11-06

Contact details of provider:
Postal: 7, S. J. S. Sansanwal Marg, New Delhi - 110016
Phone: 91-11-6564789
Fax: 91-11-6856779
Web page: http://www.isid.ac.in/~pu/
More information through EDIRC

Related research

Keywords:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
  2. Dinko Dimitrov & Thierry Marchant & Debasis Mishra, 2012. "Separability and aggregation of equivalence relations," Economic Theory, Springer, vol. 51(1), pages 191-212, September.
  3. Reffgen, Alexander & Svensson, Lars-Gunnar, 2012. "Strategy-proof voting for multiple public goods," Theoretical Economics, Econometric Society, vol. 7(3), September.
  4. Carmelo Rodriguez-Alvarez, 2005. "Strategy-Proof Coalition Formation," Economics Working Papers we055525, Universidad Carlos III, Departamento de Economía.
  5. Salvador Barbera & Hugo Sonnenschein & Lin Zhou, 1990. "Voting by Committees," Cowles Foundation Discussion Papers 941, Cowles Foundation for Research in Economics, Yale University.
  6. Svensson, Lars-Gunnar & Torstensson, Pär, 2005. "Strategy-Proof Allocation of Multiple Public Goods," Working Papers 2005:3, Lund University, Department of Economics, revised 02 Feb 2007.
  7. Jean-Pierre Barthélemy & Bruno Leclerc & Bernard Monjardet, 1986. "On the use of ordered sets in problems of comparison and consensus of classifications," Journal of Classification, Springer, vol. 3(2), pages 187-224, September.
  8. Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer, vol. 16(4), pages 557-567.
  9. Shurojit Chatterji & Arunava Sen, 2011. "Tops-only domains," Economic Theory, Springer, vol. 46(2), pages 255-282, February.
  10. Barbera Salvador & Gul Faruk & Stacchetti Ennio, 1993. "Generalized Median Voter Schemes and Committees," Journal of Economic Theory, Elsevier, vol. 61(2), pages 262-289, December.
  11. Le Breton, M. & Sen, A., 1995. "Strategyproofness and decomposability : Weak Orderings," G.R.E.Q.A.M. 95a38, Universite Aix-Marseille III.
  12. Schummer, James & Vohra, Rakesh V., 2002. "Strategy-proof Location on a Network," Journal of Economic Theory, Elsevier, vol. 104(2), pages 405-428, June.
  13. Conal Duddy & Juan Perote-Peña & Ashley Piggins, 2012. "Non-Manipulable Partitioning," New Mathematics and Natural Computation (NMNC), World Scientific Publishing Co. Pte. Ltd., vol. 8(02), pages 273-282.
  14. Christopher Chambers & Alan Miller, 2011. "Rules for aggregating information," Social Choice and Welfare, Springer, vol. 36(1), pages 75-82, January.
  15. Miller, Alan D., 2008. "Group identification," Games and Economic Behavior, Elsevier, vol. 63(1), pages 188-202, May.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:ind:isipdp:11-06

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamprasad M. Pujar).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.