Search

• < Previous
• 1
• Next >

---

On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games

Thomas Brihaye ; Véronique Bruyère ; Julie De Pril ; Hugo Gimbert.

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are&nbsp;[&hellip;]

---

Distributed Asynchronous Games With Causal Memory are Undecidable

Hugo Gimbert.

We show the undecidability of the distributed control problem when the plant is an asynchronous automaton, the controllers use causal memory and the goal of the controllers is to put each process in a local accepting state.

---