A Note on the Nash Equilibria of Some Multi-Player Reachability / Safety Games

10/04/2018
by   Athanasios Kehagias, et al.
0

In this short note we study a class of multi-player, turn-based games with deterministic state transitions and reachability / safety objectives (this class contains as special cases "classic" two-player reachability and safety games as well as multi-player "stay--in-a-set" and "reach-a-set" games). Quantitative and qualitative versions of the objectives are presented and for both cases we prove the existence of a deterministic and memoryless Nash equilibrium; the proof is short and simple, using only Fink's classic result about the existence of Nash equilibria for multi-player discounted stochastic games.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2019

On Relevant Equilibria in Reachability Games

We study multiplayer reachability games played on a finite directed grap...
research
06/15/2020

Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games

We show that the problem of deciding whether in a multi-player perfect i...
research
07/26/2019

A note on the complexity of integer programming games

In this brief note, we prove that the existence of Nash equilibria on in...
research
11/01/2020

Approximate Solutions to a Class of Reachability Games

In this paper, we present a method for finding approximate Nash equilibr...
research
09/06/2023

TSO Games – On the decidability of safety games under the total store order semantics (extended version with appendix)

We consider an extension of the classical Total Store Order (TSO) semant...
research
12/22/2022

Playing Safe, Ten Years Later

We consider two-player games over graphs and give tight bounds on the me...
research
09/27/2018

Equilibria in Quantitative Concurrent Games

Synthesis of finite-state controllers from high-level specifications in ...

Please sign up or login with your details

Forgot password? Click here to reset