On two new social choice correspondences
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.
(This abstract was borrowed from another version of this item.)
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Gilbert Laffond & Jean Lainé & Jean-François Laslier, 1996. "Composition-consistent tournament solutions and social choice functions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 13(1), pages 75-93, January.
- Borm, P.E.M. & van den Brink, J.R. & Slikker, M., 2000.
"An Iterative Procedure for Evaluating Digraph Competitions,"
788, Tilburg University, School of Economics and Management.
- Peter Borm & René van den Brink & Marco Slikker, 2002. "An Iterative Procedure for Evaluating Digraph Competitions," Annals of Operations Research, Springer, vol. 109(1), pages 61-75, January.
- Borm, P.E.M. & van den Brink, J.R. & Slikker, M., 2002. "An iterative procedure for evaluating digraph competitions," Other publications TiSEM 40ae2ec2-efdb-48f6-905c-5, Tilburg University, School of Economics and Management.
- van den Brink, J.R. & Borm, P.E.M., 2002.
"Digraph competitions and cooperative games,"
Other publications TiSEM
262e8724-0bc0-49da-99c5-f, Tilburg University, School of Economics and Management.
- Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
- Laffond, Gilbert & Laslier, Jean Francois & Le Breton, Michel, 1995.
"Condorcet choice correspondences: A set-theoretical comparison,"
Mathematical Social Sciences,
Elsevier, vol. 30(1), pages 23-35, August.
- 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.
- Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2001.
"Measuring the Power of Nodes in Digraphs,"
2001-72, Tilburg University, Center for Economic Research.
- 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).
- 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.
- Gernot Grabher & Walter W. Powell (ed.), 2004. "Networks," Books, Edward Elgar Publishing, volume 0, number 2771, June.
- 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.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:47:y:2004:i:1:p:51-68. 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: (Shamier, Wendy)
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.