Pure Nash Equilibria in Concurrent Deterministic Games

DOI10.2168/LMCS-11(2:9)2015zbMath1320.91010arXiv1503.06826OpenAlexW1758301490MaRDI QIDQ2941757

Michael Ummels, Patricia Bouyer, Romain Brenguier, Nicolas Markey

Publication date: 25 August 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.06826

zbMATH Keywords

Nash equilibriaconcurrent gamesordered objectivesqualitative objectives

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Equilibria for games with combined qualitative and quantitative objectives, Synthesis with rational environments, Extending finite-memory determinacy to multi-player games, Unnamed Item, From model checking to equilibrium checking: reactive modules for rational verification, Unnamed Item, Unnamed Item, Unnamed Item, Automated temporal equilibrium analysis: verification and synthesis of multi-player games, Unnamed Item, A Note on Game Theory and Verification, Quantum games: a review of the history, current state, and interpretation, Nash equilibria in symmetric graph games with partial observation, Unnamed Item, Unnamed Item, Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives, Dynamic resource allocation games

Uses Software

• PRALINE