On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
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 gu...
Main Authors: | Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2013-02-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/790/pdf |
Similar Items
-
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games
by: Thomas Brihaye, et al.
Published: (2020-11-01) -
Subgame-perfect Equilibria in Mean-payoff Games (journal version)
by: Léonard Brice, et al.
Published: (2023-10-01) -
O-Minimal Hybrid Reachability Games
by: Patricia Bouyer, et al.
Published: (2010-01-01) -
Reachability Switching Games
by: John Fearnley, et al.
Published: (2021-04-01) -
Stubborn Set Reduction for Two-Player Reachability Games
by: Frederik Meyer Bønneland, et al.
Published: (2021-03-01)