On the complexity of Slater’s problems
Author:
- Olivier HudryOHOlivier Hudry
- 1 May 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 203 (1) , 216-221
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A survey on the complexity of tournament solutionsMathematical Social Sciences, 2009
- The Minimum Feedback Arc Set Problem is NP-Hard for TournamentsCombinatorics, Probability and Computing, 2006
- Ranking TournamentsSIAM Journal on Discrete Mathematics, 2006
- A note on ?Banks winners in tournaments are difficult to recognize? by G. J. WoegingerSocial Choice and Welfare, 2004
- Banks winners in tournaments are difficult to recognizeSocial Choice and Welfare, 2003
- Slater orders and Hamiltonian paths of tournamentsElectronic Notes in Discrete Mathematics, 2000
- Sophisticated voting outcomes and agenda controlSocial Choice and Welfare, 1985
- The median procedure in cluster analysis and social choice theoryMathematical Social Sciences, 1981
- Inconsistencies in a schedule of paired comparisonsBiometrika, 1961
- Les théories de l’intérêt général et le problème logique de l’agrégationÉconomie appliquée, 1952