Finding mixed strategies with small supports in extensive form games
- 1 March 1996
- journal article
- research article
- Published by Springer Nature in International Journal of Game Theory
- Vol. 25 (1) , 73-92
- https://doi.org/10.1007/bf01254386
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Linear Complementarity ProblemPublished by Society for Industrial & Applied Mathematics (SIAM) ,2009
- Using fast matrix multiplication to find basic solutionsTheoretical Computer Science, 1998
- Fast algorithms for finding randomized strategies in game treesPublished by Association for Computing Machinery (ACM) ,1994
- The complexity of two-person zero-sum games in extensive formGames and Economic Behavior, 1992
- Computing Equilibria of Two-Person Games from the Extensive FormManagement Science, 1972
- Computing Equilibria of N-Person GamesSIAM Journal on Applied Mathematics, 1971
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person GamesSIAM Journal on Applied Mathematics, 1971
- Equilibrium Points of Bimatrix GamesJournal of the Society for Industrial and Applied Mathematics, 1964
- Extensive GamesProceedings of the National Academy of Sciences, 1950