Abstract
The purpose of this paper is to present and provide several results dealing with the concept of composed tournament. This concept has been introduced by Fried & Lakser (1971) and has deserved some attention only as a pure graph-theoretical notion. Using the fact that the tournament structure may be relevant for various areas in Decision Theory, including Social Choice (and especially theory of voting games), our first aim is to give some insights of such a concept from this last perspective.
The authors wish to thank Bernard Monjardet and Michel Lebreton for very helpful comments, and all participants to the FUR VI Conference for suggestions of possible ways to imporve the presentation of an earlier draft.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Astie-Vidal A. Matteo, 1987, “ Non Simple Tournaments: Theoretical Properties and a Polynomial Agorithm ” Proceedings of the 5th International Conference AAECC, Lecture Notes in Computer Science, Vol. 356, pp. 1–15
L.W. Beineke, K.B. Reid, 1978, “ Tournaments ”, Chapter 7 in Selected Topics in Graph Theory, L.W. Beineke and R.J. Wilson ( Eds ), Academic Press.
A. Bouchet, 1987, “ Digraph Decompositions and Eulerian Systems ” SIAM Journal of Alg. Methods, Vol. 8, NO 3.
W.H. Cunningham, 1982, “ Decomposition of Directed Graphs ” SIAM Journal of Alg. Methods, Vol. 3, NO 2.
H.A. David, 1968, The Method of Paired Comparisons, Griffin’s Statistical Monographs and Courses, Griffin, London.
P. Erdos, E. Fried, A. Hajnal E.C. Milner, 1972, “ Some Remarks on Simple Tournaments ” Algebra Universalis, Vol. 2, pp. 238–245.
P. Erdos, A. Hajnal E.C. Milner, 1972, “ Simple One-Point Extentions of Tournaments ” Matheinatika, Vol. 19, pp. 5762.
E. Fried H. Lakser, 1971, “ Simple Tournaments ” Notices of the American Mathematical Society, Vol. 18, p. 295.
D.C. Fisher, J. Ryan, 1991a, “ Optimal Strategies for a Generalized ”Scissors,Paper, and Stone “ Game ” Mimeo.
D.C. Fisher, J. Ryan, 1992b, “ Tournament Games and Positive Tournaments ” Mimeo.
W. Imrich J. Nesetril, 1992, “Simple Tournaments and Sharply Transitive Groups”, Discrete Mathematics, Vol. 108, pp. 159–165.
M.G. Kendall, 1970, Rank Correlation Methods Griffin, London.
G. Laffond, J. Lainé, 1994, “ Weak Covering Relations in Tournaments ” forthcoming in Theory Decision.
G. Laffond, J. Lainé, J.F. Laslier, 1994, “Existence of Regular Composed Tournaments”, mimeo, CNAM.
G. Laffond, J.F. Laslier, M. Lebreton, 1992, “ Condorcet Choice Correspondences: A Full Set-theoretical Comparison ” forthcoming in Mathematical Social Sciences.
G. Laffond, J.F. Laslier, M. Lebreton, 1993, “ The Bipartisan Set of a Tournament Game ”, Gaines Economic Behavior, Vol. 5, pp. 182–201.
D.S. Mc Garvey, 1953, “ A Theorem on the Construction of Voting Paradoxes ”, Econometrica, Vol. 21, pp. 608–610.
R.H. Mohring F.J. Radermacher, 1984, “ Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization”, Annales of Discrete Mathematics, Vol. 19, pp. 257–356.
J.W. Moon, 1968, Topics on Tournaments, Holt, Rinehart and Winston.
J.W. Moon, 1972, “Embedding Tournaments in Simple Tournaments”, Discrete Mathematics, Vol. 2, pp. 389–395.
H. Moulin, 1986, “ Choosing From a Tournament ”, Social Choice Welfare, Vol. 2, pp. 271–291.
R. Stearns, 1959, “ The Voting Problem ”, American Mathematical Monthly, Vol. 66, pp. 761–763.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Laffond, G., Laine, J., Laslier, JF. (1994). On Regular Composed Tournaments. In: Munier, B., Machina, M.J. (eds) Models and Experiments in Risk and Rationality. Theory and Decision Library, vol 29. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2298-8_18
Download citation
DOI: https://doi.org/10.1007/978-94-017-2298-8_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4447-1
Online ISBN: 978-94-017-2298-8
eBook Packages: Springer Book Archive