Computing sequential equilibria for two-player games

DOI10.1145/1109557.1109570zbMath1192.91020OpenAlexW4237922462MaRDI QIDQ3581574

Peter Bro Miltersen, Troels Bjerre Sørensen

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109570

Mathematics Subject Classification ID

2-person games (91A05) Games in extensive form (91A18)

Related Items

Computing a quasi-perfect equilibrium of a two-player game, Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm, New complexity results about Nash equilibria, Alternating-offers bargaining in one-to-many and many-to-many settings, The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game, On the Hardness and Existence of Quasi-Strict Equilibria, Extending the alternating-offers protocol in the presence of competition: Models and theoretical analysis