Subgame-perfect Equilibria in Mean-payoff Games (journal version)

DOI10.46298/lmcs-19(4:6)2023arXiv2203.08546MaRDI QIDQ6178672

Unnamed Author, Marie van den Bogaard, Jean-François Raskin

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

games on graphsmean-payoff objectivessubgame-perfect equilibria

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Synthesis with rational environments
• On refinements of subgame perfect \(\epsilon\)-equilibrium
• Strategy logic
• Borel determinacy
• Deterministic multi-player Dynkin games.
• Pareto curves of multidimensional mean-payoff games
• The complexity of multi-mean-payoff and multi-energy games
• Computer aided synthesis: a game-theoretic approach
• On the Existence of Weak Subgame Perfect Equilibria
• Perfect-Information Games with Lower-Semicontinuous Payoffs
• Multiplayer Cost Games with Simple Nash Equilibria
• Mean-Payoff Automaton Expressions
• Half-Positional Determinacy of Infinite Games
• A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games of Perfect Information
• Secure equilibria in weighted games
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• The Complexity of Nash Equilibria in Infinite Multiplayer Games

This page was built for publication: Subgame-perfect Equilibria in Mean-payoff Games (journal version)