Finding Equilibria in Games of No Chance

DOI10.1007/978-3-540-73545-8_28MaRDI QIDQ3608853zbMATHOpenAlexFDO

Authors Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_28

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 2-person games (91A05) Games in extensive form (91A18)

Recommendations

• The complexity of two-person zero-sum games in extensive form
• Computation of equilibria in noncooperative games
• Equilibrium computation for two-player games in strategic and extensive form
• Efficient computation of equilibria for extensive two-person games
• Finding mixed strategies with small supports in extensive form games

Cited in

(7)

• The complexity of two-person zero-sum games in extensive form
• Approximating maxmin strategies in imperfect recall games using A-loss recall property
• Computation of equilibria in noncooperative games
• Lossless abstraction of imperfect information games
• Fast algorithms for finding randomized strategies in game trees
• Chess-like games may have no uniform Nash equilibria even in mixed strategies
• Computing equilibria: a computational complexity perspective

This page was built for publication: Finding Equilibria in Games of No Chance

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