| KLIMOŠ, Miroslav, Kim G. LARSEN, Jeppe THAARUP a Filip ŠTEFAŇÁK. Nash Equilibria in Concurrent Priced Games. In Adrian-Horia Dediu, Carlos Martín-Vide. Language and Automata Theory and Applications, 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings. La Coruna; Spain: Springer Berlin / Heidelberg, 2012, s. 363-376. ISBN 978-3-642-28331-4. Dostupné z: https://dx.doi.org/10.1007/978-3-642-28332-1_31. |
Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{975085,
author = {Klimoš, Miroslav and Larsen, Kim G. and Thaarup, Jeppe and Štefaňák, Filip},
address = {La Coruna; Spain},
booktitle = {Language and Automata Theory and Applications, 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings},
doi = {http://dx.doi.org/10.1007/978-3-642-28332-1_31},
editor = {Adrian-Horia Dediu, Carlos Martín-Vide},
keywords = {Concurrent games; Finite graphs; Multiplayer games; Nash equilibria; NP Complete; Pareto-optimal; Pure Nash equilibrium},
howpublished = {tištěná verze "print"},
language = {eng},
location = {La Coruna; Spain},
isbn = {978-3-642-28331-4},
pages = {363-376},
publisher = {Springer Berlin / Heidelberg},
title = {Nash Equilibria in Concurrent Priced Games},
year = {2012}
}
TY - JOUR
ID - 975085
AU - Klimoš, Miroslav - Larsen, Kim G. - Thaarup, Jeppe - Štefaňák, Filip
PY - 2012
TI - Nash Equilibria in Concurrent Priced Games
PB - Springer Berlin / Heidelberg
CY - La Coruna; Spain
SN - 9783642283314
KW - Concurrent games
KW - Finite graphs
KW - Multiplayer games
KW - Nash equilibria
KW - NP Complete
KW - Pareto-optimal
KW - Pure Nash equilibrium
N2 - Concurrent game structures model multi-player games played on finite graphs where the players simultaneously choose their moves and collectively determine the next state of the game. We extend this model with prices on transitions for each player. We study pure Nash equilibria in this framework where each player’s payoff is the accumulated price of all transitions until reaching their goal state. We provide a construction of a Büchi automaton accepting all Nash equilibria outcomes and show how this construction can be used to solve a variety of related problems, such as finding pareto-optimal equilibria. Furthermore, we prove the problem of deciding the existence of equilibria to be NP-complete.
ER -
KLIMOŠ, Miroslav, Kim G. LARSEN, Jeppe THAARUP a Filip ŠTEFAŇÁK. Nash Equilibria in Concurrent Priced Games. In Adrian-Horia Dediu, Carlos Martín-Vide. \textit{Language and Automata Theory and Applications, 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings}. La Coruna; Spain: Springer Berlin / Heidelberg, 2012, s.~363-376. ISBN~978-3-642-28331-4. Dostupné z: https://dx.doi.org/10.1007/978-3-642-28332-1\_{}31.
|
