The minimal covering set in large tournaments
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.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 38 (2012)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
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.:
- Felix Brandt & Felix Fischer & Paul Harrenstein & Maximilian Mair, 2010. "A computational analysis of the tournament equilibrium set," Social Choice and Welfare, Springer, vol. 34(4), pages 597-609, April.
- Mark Fey, 2008. "Choosing from a large tournament," Social Choice and Welfare, Springer, vol. 31(2), pages 301-309, August.
- Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
- Bell, Colin E, 1981. "A Random Voting Graph Almost Surely Has a Hamiltonian Cycle When the Number of Alternatives Is Large," Econometrica, Econometric Society, vol. 49(6), pages 1597-1603, November.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.