The complexity of SPEs in mean-payoff games

DOI10.4230/LIPICS.ICALP.2022.116MaRDI QIDQ6560917zbMATH OpenFDO

Authors Jean-François Raskin, Bogaard Marie van Den

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.116

zbMATH Keywords

games on graphsmean-payoff objectivessubgame-perfect equilibria

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(4)

• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• As soon as possible but rationally
• Permissive equilibria in multiplayer reachability games
• The non-cooperative rational synthesis problem for SPEs and -regular objectives

This page was built for publication: The complexity of SPEs in mean-payoff games

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