IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

Separability and aggregation of equivalence relations

  • Dinko Dimitrov

    ()

    (University of Munich)

  • Thierry Marchant

    ()

    (Ghent University)

  • Debasis Mishra

    ()

    (Indian Statistical Institute, New Delhi)

We provide axiomatic characterizations of two natural families of rules for aggregating equivalence relations: the family of join aggregators and the family of meet aggregators. The central conditions in these characterizations are two separability axioms. Disjunctive separability, neutrality, and unanimity characterize the family of join aggregators. On the other hand, conjunctive separability and unanimity characterize the family of meet aggregators. We show another characterization of the family of meet aggregators using conjunctive separability and two Pareto axioms, Pareto+ and Pareto-. If we drop Pareto-, then conjunctive separability and Pareto+ characterize the family of meet aggregators along with a trivial aggregator

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/dp09-06.pdf
Download Restriction: no

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

as
in new window

Length: 23 pages
Date of creation: Aug 2009
Date of revision:
Handle: RePEc:ind:isipdp:09-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

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. 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.
  2. Dimitrov, Dinko & Puppe, Clemens, 2011. "Non-bossy social classification," Working Paper Series in Economics 23, Karlsruhe Institute of Technology (KIT), Department of Economics and Business Engineering.
  3. David Schmeidler, 2000. "Between LIberalism and Democracy," Working Papers 00-08, Ohio State University, Department of Economics.
  4. Murat Çengelci & M. Sanver, 2010. "Simple Collective Identity Functions," Theory and Decision, Springer, vol. 68(4), pages 417-443, April.
  5. Nicolas, Houy, 2007. ""I want to be a J!": Liberalism in group identification problems," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 59-70, July.
  6. Dinko Dimitrov & Shao Chin Sung & Yongsheng Xu, 2006. "Procedural group identification," Working Papers 383, Bielefeld University, Center for Mathematical Economics.
  7. J. Barthélemy, 1988. "Comments on “aggregation of equivalence relations” by P. C. Fishburn and A. Rubinstein," Journal of Classification, Springer, vol. 5(1), pages 85-87, March.
  8. Peter Fishburn & Ariel Rubinstein, 1986. "Aggregation of equivalence relations," Journal of Classification, Springer, vol. 3(1), pages 61-65, March.
  9. Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
  10. Rubinstein, Ariel & Fishburn, Peter C., 1986. "Algebraic aggregation theory," Journal of Economic Theory, Elsevier, vol. 38(1), pages 63-77, February.
  11. Miller, Alan D., 2008. "Group identification," Games and Economic Behavior, Elsevier, vol. 63(1), pages 188-202, May.
  12. Dean Neumann & Victor Norton, 1986. "Clustering and isolation in the consensus problem for partitions," Journal of Classification, Springer, vol. 3(2), pages 281-297, September.
  13. John Geanakoplos, 2005. "Three brief proofs of Arrow’s Impossibility Theorem," Economic Theory, Springer, vol. 26(1), pages 211-215, 07.
  14. Leclerc, B., 1984. "Efficient and binary consensus functions on transitively valued relations," Mathematical Social Sciences, Elsevier, vol. 8(1), pages 45-61, August.
Full references (including those not matched with items on IDEAS)

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

When requesting a correction, please mention this item's handle: RePEc:ind:isipdp:09-06. See general information about how to correct material in RePEc.

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.