Condorcet choice correspondences: A set-theoretical comparison
Download full text from publisher
As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.
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.
References listed on IDEAS
- 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.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Klamler, Christian, 2004. "The Dodgson ranking and the Borda count: a binary comparison," Mathematical Social Sciences, Elsevier, vol. 48(1), pages 103-108, July.
- Laslier, Jean-Francois, 1996. "Rank-based choice correspondences," Economics Letters, Elsevier, vol. 52(3), pages 279-286, September.
- Ayllon Aragon, Grisel, 2013. "On Weak Condorcet Winners: Existence and Uniqueness," MPRA Paper 53272, University Library of Munich, Germany.
- De Donder, Philippe & Le Breton, Michel & Truchon, Michel, 2000. "Choosing from a weighted tournament1," Mathematical Social Sciences, Elsevier, vol. 40(1), pages 85-109, July.
- Begoña Subiza & Josep Peris, 2005. "Condorcet choice functions and maximal elements," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 24(3), pages 497-508, June.
- Brandt, Felix & Fischer, Felix, 2008. "Computing the minimal covering set," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 254-268, September.
- 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.
- Mark Fey, 2008. "Choosing from a large tournament," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(2), pages 301-309, August.
- Martin, Mathieu & Merlin, Vincent, 2002.
"The stability set as a social choice correspondence,"
Mathematical Social Sciences,
Elsevier, vol. 44(1), pages 91-113, September.
- Mathieu Martin & Vincent Merlin, 2002. "The stability set as a social choice correspondence," Post-Print halshs-00069520, HAL.
- repec:ebl:ecbull:v:4:y:2003:i:8:p:1-7 is not listed on IDEAS
- Gilbert Laffond & Jean Lainé, 2009. "Condorcet choice and the Ostrogorski paradox," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(2), pages 317-333, February.
- Joseph, Rémy-Robert, 2010. "Making choices with a binary relation: Relative choice axioms and transitive closures," European Journal of Operational Research, Elsevier, vol. 207(2), pages 865-877, December.
- Laffond, Gilbert & Laine, Jean, 2000. "Representation in majority tournaments," Mathematical Social Sciences, Elsevier, vol. 39(1), pages 35-53, January.
More about this item
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:31:y:1996:i:1:p:59b-59b. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .
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 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 RePEc Author Service 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.