scientific article; zbMATH DE number 7561653

DOI10.4230/LIPIcs.MFCS.2019.9MaRDI QIDQ5092367

Patricia Bouyer, Nathan Thomasset

Publication date: 21 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Nash equilibriapartial informationmultiplayer games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

A Note on Game Theory and Verification

Cites Work

• Unnamed Item
• Games with secure equilibria
• Games on graphs with a public signal monitoring
• Repeated proximity games.
• Robust Equilibria in Mean-Payoff Games
• Pure Nash Equilibria in Concurrent Deterministic Games
• Mixed Nash Equilibria in Concurrent Terminal-Reward Games
• The Complexity of Nash Equilibria in Limit-Average Games
• The Complexity of Nash Equilibria in Stochastic Multiplayer Games
• Alternating-time temporal logic
• The Complexity of Rational Synthesis
• Computer Science Logic
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Equilibrium points in n -person games

This page was built for publication: