Computing approximate Nash equilibria and robust best-responses using sampling

MaRDI QIDQ3112641zbMATH OpenFDO

Authors Marc Ponsen, Steven de Jong, Marc Lanctot

Publication date 12 January 2012

Full work available at URL https://arxiv.org/abs/1401.4591

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Stochastic games, stochastic differential games (91A15) Probabilistic games; gambling (91A60)

Recommendations

• Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information
• Solving for Best Responses and Equilibria in Extensive-Form Games with Reinforcement Learning Methods
• Simple search methods for finding a Nash equilibrium
• Lossless abstraction of imperfect information games
• Equilibrium computation for two-player games in strategic and extensive form

Cited in

(6)

• Counterfactual regret minimization for integrated cyber and air defense resource allocation
• Augmented probability simulation methods for sequential games
• A survey of decision making and optimization under uncertainty
• Algorithms for computing strategies in two-player simultaneous move games
• Comparing human behavior models in repeated Stackelberg security games: an extended study
• A survey of opponent modeling in adversarial domains

This page was built for publication: Computing approximate Nash equilibria and robust best-responses using sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3112641)