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...

Descripció completa

Dades bibliogràfiques

Autors principals:	Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert
Format:	Artigo
Idioma:	Inglês
Publicat:	Logical Methods in Computer Science e.V. 2013-02-01
Col·lecció:	Logical Methods in Computer Science
Matèries:	computer science - computer science and game theory computer science - logic in computer science d.2.4
Accés en línia:	https://lmcs.episciences.org/790/pdf
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!