A computational analysis of the tournament equilibrium set

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 38-43

  Brandt, Felix ^a   Fischer, Felix ^a   Harrenstein, Paul ^a   Mair, Maximilian ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIONICS; ELECTRIC SHIP EQUIPMENT; HEURISTIC ALGORITHMS; RECURSIVE FUNCTIONS;

COMPUTATIONAL ANALYSES; DOMINANCE RELATIONS; EQUILIBRIUM SETS; MONOTONICITY; MULTI-AGENT SYSTEMS; NP-HARD; OPEN PROBLEMS; RECURSIVE DEFINITIONS; SOLUTION CONCEPTS;

ARTIFICIAL INTELLIGENCE;

EID: 57749208354     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Bouyssou, D.; Marchant, T.; Pirlot, M.; Tsoukiàs, A.; and Vincke, P. 2006. Evaluation and Decision Models: Stepping Stones for the Analyst. Springer- Verlag.
2. Brandt, F., and Fischer, F. 2007. Computational aspects of covering in dominance graphs. In Holte, R. C., and Howe, A., eds., Proceedings of the 22nd Conference on Artificial Intelligence (AAAI), 694-699. AAAI Press.
3. Brandt, F., and Harrenstein, P. 2007. Dominance in social choice and coalitional game theory. Presented at the 5th International Conference on Logic, Game Theory and Social Choice (LGS).
4. Brandt, F.; Fischer, F.; and Harrenstein, P. 2007. The computational complexity of choice sets. In Samet, D., ed., Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 82-91. ACM Press.
5. Conitzer, V.; Davenport, A.; and Kalagnanam, J. 2006. Improved bounds for computing Kemeny rankings. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), 620-627. AAAI Press.
6. Conitzer, V. 2006. Computing Slater rankings using similarities among candidates. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), 613-619. AAAI Press.
7. Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; and Stein, C. 2001. Introduction to Algorithms. MIT Press, 2nd edition.
8. de Condorcet, M. 1785. Essai sur l'application de l'analyse à la probabilité de décisions rendues à la pluralité de voix. Imprimerie Royal. Facsimile published in 1972 by Chelsea Publishing Company, New York.
9. Duggan, J., and Le Breton, M. 1996. Dutta's minimal covering set and Shapley's saddles. Journal of Economic Theory 70:257-265.
10. Dung, P. M. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77:321-357.
11. Dunne, P. E. 2007. Computational properties of argumentation systems satisfying graph-theoretic constraints. Artificial Intelligence 171(10-15):701-729.
12. Dutta, B., and Laslier, J. -F. 1999. Comparison functions and choice correspondences. Social Choice and Welfare 16(4):513-532.
13. Dutta, B. 1990. On the tournament equilibrium set. Social Choice and Welfare 7(4):381-383.
14. Fishburn, P. C. 1977. Condorcet social choice functions. SIAM Journal on Applied Mathematics 33(3):469-489.
15. Gillies, D. B. 1959. Solutions to general non-zero-sum games. In Tucker, A. W., and Luce, R. D., eds., Contributions to the Theory of Games IV, volume 40 of Annals of Mathematics Studies. Princeton University Press. 47-85.
16. Laffond, G.; Laslier, J. -F.; and Breton, M. L. 1993. More on the tournament equilibrium set. Mathématiques et sciences humaines 31(123):37-44.
17. Laslier, J. -F. 1997. Tournament Solutions and Majority Voting. Springer.
18. Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley.
19. Schwartz, T. 1990. Cyclic tournaments and cooperative majority voting: A solution. Social Choice and Welfare 7:19-29.
20. Woeginger, G. J. 2003. Banks winners in tournaments are difficult to recognize. Social Choice and Welfare 20:523-528.