Finding mixed strategies with small supports in extensive form games

DOI10.1007/BF01254386zbMath0856.90143MaRDI QIDQ1814784

Daphne Koller, Nimrod Megiddo

Publication date: 27 February 1997

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

equilibriaexponential-time algorithmtwo-person game in extensive form

Mathematics Subject Classification ID

Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60) 2-person games (91A05)

Related Items

THE H-STRATEGIES IN EXTENSIVE FORM GAMES, A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES, The complexity of two-person zero-sum games in extensive form, Computer science and decision theory

Cites Work

• Unnamed Item
• The complexity of two-person zero-sum games in extensive form
• Using fast matrix multiplication to find basic solutions
• Fast algorithms for finding randomized strategies in game trees
• Constructing Small Sample Spaces Satisfying Given Constraints
• Closure Properties of Independence Concepts for Continuous Utilities
• Equilibrium Points of Bimatrix Games
• Computing Equilibria of N-Person Games
• On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
• Computing Equilibria of Two-Person Games from the Extensive Form
• Extensive Games