Condorcet choice correspondences: A set-theoretical comparison
AbstractNo abstract is available for this item.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Mathematical Social Sciences.
Volume (Year): 31 (1996)
Issue (Month): 1 (February)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
Other versions of this item:
- 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.
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.:
- Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
- 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.
- Banks, J.S. & Bordes, G., 1991. "Covering Relations, Closest Ordering and Hamiltonian Bypaths in Tournaments," G.R.E.Q.A.M. 91a05, Universite Aix-Marseille III.
- Begoña Subiza & Josep Peris, 2005.
"Condorcet choice functions and maximal elements,"
Social Choice and Welfare,
Springer, vol. 24(3), pages 497-508, 06.
- Klamler, Christian, 2004. "The Dodgson ranking and the Borda count: a binary comparison," Mathematical Social Sciences, Elsevier, vol. 48(1), pages 103-108, July.
- Ayllon Aragon, Grisel, 2013. "On Weak Condorcet Winners: Existence and Uniqueness," MPRA Paper 53272, University Library of Munich, Germany.
- Gilbert Laffond & Jean Lainé, 2009. "Condorcet choice and the Ostrogorski paradox," Social Choice and Welfare, Springer, vol. 32(2), pages 317-333, February.
- Laslier, Jean-Francois, 1996. "Rank-based choice correspondences," Economics Letters, Elsevier, vol. 52(3), pages 279-286, September.
- Mark Fey, 2008. "Choosing from a large tournament," Social Choice and Welfare, Springer, vol. 31(2), pages 301-309, August.
- Borm, Peter & van den Brink, Rene & Levinsky, Rene & Slikker, Marco, 2004.
"On two new social choice correspondences,"
Mathematical Social Sciences,
Elsevier, vol. 47(1), pages 51-68, January.
- Brandt, Felix & Fischer, Felix, 2008. "Computing the minimal covering set," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 254-268, September.
- Martin, Mathieu & Merlin, Vincent, 2002. "The stability set as a social choice correspondence," Mathematical Social Sciences, Elsevier, vol. 44(1), pages 91-113, September.
- repec:ebl:ecbull:v:4:y:2003:i:8:p:1-7 is not listed on IDEAS
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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.