Computing the optimal strategy to commit to
- 11 June 2006
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Complexity of (iterated) dominancePublished by Association for Computing Machinery (ACM) ,2005
- A polynomial-time nash equilibrium algorithm for repeated gamesPublished by Association for Computing Machinery (ACM) ,2003
- Efficient Computation of Equilibria for Extensive Two-Person GamesGames and Economic Behavior, 1996
- The Complexity of Eliminating Dominated StrategiesMathematics of Operations Research, 1993
- The complexity of two-person zero-sum games in extensive formGames and Economic Behavior, 1992
- Nash and correlated equilibria: Some complexity considerationsGames and Economic Behavior, 1989
- A note on strategy elimination in bimatrix gamesOperations Research Letters, 1988
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Equilibrium points in n -person gamesProceedings of the National Academy of Sciences of the United States of America, 1950
- Zur Theorie der GesellschaftsspieleMathematische Annalen, 1928