Nash equilibria in symmetric graph games with partial observation

DOI10.1016/j.ic.2016.10.010zbMath1371.91021arXiv1404.0839OpenAlexW2963845824MaRDI QIDQ528190

Patricia Bouyer, Nicolas Markey, Steen Vester

Publication date: 12 May 2017

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

symmetryNash equilibriumgames on graphsnetwork of systems

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)

Related Items

Game-based Synthesis of Distributed Controllers for Sampled Switched Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Control of parameterized discrete event systems
• Games with secure equilibria
• Augmenting ATL with strategy contexts
• Strategy logic
• Symmetries and the complexity of pure Nash equilibrium
• Positional strategies for mean payoff games
• Automata, logics, and infinite games. A guide to current research
• Modular strategies for recursive game graphs
• Non-cooperative games
• Concurrent Games with Ordered Objectives
• Parameterized Model Checking of Token-Passing Systems
• Pure Nash Equilibria in Concurrent Deterministic Games
• Reasoning About Strategies
• Mixed Nash Equilibria in Concurrent Terminal-Reward Games
• Parameterized Model Checking of Rendezvous Systems
• The Complexity of Nash Equilibria in Stochastic Multiplayer Games
• Alternating-time temporal logic
• Multiagent Systems
• The Existence of Equilibrium in Discontinuous Economic Games, I: Theory
• The complexity of propositional linear temporal logics
• Reasoning about systems with many processes
• Computer Science Logic
• CONCUR 2004 - Concurrency Theory
• Playing with Probabilities in Reconfigurable Broadcast Networks
• Equilibrium points in n -person games
• Stochastic Games