Advanced Search
MyIDEAS: Login to save this paper or follow this series

On Two New Social Choice Correspondences

Contents:

Author Info

  • Borm, P.E.M.
  • Brink, J.R. van den
  • Levinsky, R.
  • Slikker, M.

    (Tilburg University, Center for Economic Research)

Abstract

Preferences of a set of n individuals over a set of alternatives can be represented by a preference profile being an n-tuple of preference relations over these alternatives.A social choice correspondence assigns to every preference profile a subset of alternatives that can be viewed as the `most prefered' alternatives by the society consisting of all individuals.Two new social choice correspondences are introduced and analyzed.Both are Pareto optimal and are refinements of the well known Top cycle correspondence in case the corresponding simple majority win digraph is a tournament.One of them even is such a refinement for arbitrary preference profiles.

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://arno.uvt.nl/show.cgi?fid=4183
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2000-125.

as in new window
Length:
Date of creation: 2000
Date of revision:
Handle: RePEc:dgr:kubcen:2000125

Contact details of provider:
Web page: http://center.uvt.nl

Related research

Keywords: preferences; public choice;

Other versions of this item:

Find related papers by JEL classification:

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. Laffond G. & Laslier J. F. & Le Breton M., 1993. "The Bipartisan Set of a Tournament Game," Games and Economic Behavior, Elsevier, vol. 5(1), pages 182-201, January.
  2. Herings,P. Jean-Jacques & Laan,Gerard,van der & Talman,Dolf, 2001. "Measuring the Power of Nodes in Digraphs," Research Memorandum 007, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  3. Laffond G. & Laslier, J. F. & Le Breton, M., 1996. "Condorcet choice correspondences: A set-theoretical comparison," Mathematical Social Sciences, Elsevier, vol. 31(1), pages 59-59, February.
  4. Brink, J.R. van den & Borm, P.E.M., 2002. "Digraph competitions and cooperative games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-123145, Tilburg University.
  5. P. Jean-Jacques Herings & Gerard van der Laan & Dolf Talman, 2001. "Measuring the Power of Nodes in Digraphs," Tinbergen Institute Discussion Papers 01-096/1, Tinbergen Institute.
  6. Gilbert Laffond & Jean Lainé & Jean-François Laslier, 1996. "Composition-consistent tournament solutions and social choice functions," Social Choice and Welfare, Springer, vol. 13(1), pages 75-93, January.
  7. Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
  8. Borm, P.E.M. & Brink, J.R. van den & Slikker, M., 2002. "An iterative procedure for evaluating digraph competitions," Open Access publications from Tilburg University urn:nbn:nl:ui:12-90188, Tilburg University.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Brink, J.R. van den & Borm, P.E.M., 1994. "Digraph competitions and cooperative games," Discussion Paper 1994-24, Tilburg University, Center for Economic Research.
  2. Marco Slikker & Peter Borm & René Brink, 2012. "Internal slackening scoring methods," Theory and Decision, Springer, vol. 72(4), pages 445-462, April.
  3. Quant, M. & Borm, P.E.M. & Reijnierse, J.H. & Voorneveld, M., 2002. "Characterizations of Solutions in Digraph Competitions," Discussion Paper 2002-113, Tilburg University, Center for Economic Research.
  4. Ayllon Aragon, Grisel, 2013. "On Weak Condorcet Winners: Existence and Uniqueness," MPRA Paper 53272, University Library of Munich, Germany.
  5. Marieke Quant & Peter Borm & Hans Reijnierse & Mark Voorneveld, 2006. "A note on theβ-measure for digraph competitions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 14(1), pages 167-176, June.

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:dgr:kubcen:2000125. 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: (Richard Broekman).

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.