Computing sequential equilibria for two-player games

DOI10.1145/1109557.1109570MaRDI QIDQ3581574zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(7)

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

This page was built for publication: Computing sequential equilibria for two-player games

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