Positionality of mean-payoff games on infinite graphs

2023/04/29 by Ohlmann, Pierre
#Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2305.00347

Abstract

This short note establishes positionality of mean-payoff games over infinite game graphs by constructing a well-founded monotone universal graph.

Related

• Positionality in Σ₀² and a completeness result
• On Memoryless Quantitative Objectives
• Subgame-perfect Equilibria in Mean-payoff Games
• Infinite lexicographic products of positional objectives
• Positional Games