AI Chat AI Image Generator AI Video Text to Speech

Positionality of mean-payoff games on infinite graphs

04/29/2023
∙
by   Pierre Ohlmann, et al.
∙
0
∙

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

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 04/12/2021

The Theory of Universal Graphs for Infinite Duration Games

We introduce the notion of universal graphs as a tool for constructing a...
0 Thomas Colcombet, et al. ∙
research
∙ 05/17/2023

Games on Graphs

The objective of this collaborative textbook is to present the state of ...
0 Nathanaël Fijalkow, et al. ∙
research
∙ 11/14/2022

Infinite horizon for symetric strategy population game

To predict the behavior of a population game when time becomes very long...
0 Meziane Privat, et al. ∙
research
∙ 06/19/2020

Extensive Infinite Games and Escalation, an exercise in Agda

Escalation in games is when agents keep playing forever. Based on formal...
0 Pierre Lescanne, et al. ∙
research
∙ 05/25/2023

Solving Infinite-State Games via Acceleration

Two-player graph games have found numerous applications, most notably th...
0 Philippe Heim, et al. ∙
research
∙ 09/24/2022

Characterising memory in infinite games

This paper is concerned with games of infinite duration played over pote...
0 Antonio Casares, et al. ∙
research
∙ 05/09/2022

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

We study turn-based quantitative games of infinite duration opposing two...
0 Pierre Ohlmann, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal