The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games

We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium (NE), we focus on the notion of subgame perfect equilibrium (...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
Format:	Artigo
Sprog:	Inglês
Udgivet:	Logical Methods in Computer Science e.V. 2020-11-01
Serier:	Logical Methods in Computer Science
Fag:	computer science - computer science and game theory computer science - logic in computer science
Online adgang:	https://lmcs.episciences.org/5966/pdf
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!