Nash Equilibria in Concurrent Priced Games

DOI10.1007/978-3-642-28332-1_31zbMath1351.68182OpenAlexW2127747272MaRDI QIDQ2890209

Jeppe Thaarup, Miroslav Klimoš, Filip Štefaňák, Kim Guldstrand Larsen

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28332-1_31

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Formal languages and automata (68Q45) (n)-person games, (n>2) (91A06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Model Checking Real-Time Systems ⋮ Multiplayer Cost Games with Simple Nash Equilibria ⋮ Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games ⋮ Non-blind strategies in timed network congestion games

This page was built for publication: Nash Equilibria in Concurrent Priced Games