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 (...
Сохранить в:
| Главные авторы: | , , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Logical Methods in Computer Science e.V.
2020-11-01
|
| Серии: | Logical Methods in Computer Science |
| Предметы: | |
| Online-ссылка: | https://lmcs.episciences.org/5966/pdf |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|