𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the problem of reconstructing a tournament from subtournaments

✍ Scribed by Frank Harary; Ed Palmer

Publisher
Springer Vienna
Year
1967
Tongue
English
Weight
451 KB
Volume
71
Category
Article
ISSN
0026-9255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A combinatorial property of the maximum
A combinatorial property of the maximum round robin tournament problem
✍ Andrei Horbach πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 430 KB

We prove a new combinatorial property of the maximum round robin tournament (MRRT) problem. This property allows us to answer negatively the question of Briskorn, whether the optimal objective value of the MRRT problem and that of its conventional linear relaxation always coincide.

On the evolution of a random tournament
On the evolution of a random tournament
✍ Tomasz Łuczak; Andrzej RuciΕ„ski; Jacek Gruszka πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 280 KB
On the Problem of Optimal Reconstruction
On the Problem of Optimal Reconstruction
✍ Alexander Kushpel; Sergio Tozoni πŸ“‚ Article πŸ“… 2007 πŸ› SP BirkhΓ€user Verlag Boston 🌐 English βš– 211 KB
A survey on the complexity of tournament
A survey on the complexity of tournament solutions
✍ Olivier Hudry πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 560 KB

In voting theory, the result of a paired comparison method such as the one suggested by Condorcet can be represented by a tournament, i.e., a complete asymmetric directed graph. When there is no Condorcet winner, i.e., a candidate preferred to any other candidate by a majority of voters, it is not a