scientific article; zbMATH DE number 7439731

zbMath1478.91035arXiv1609.04089MaRDI QIDQ5015269

Nicolas Markey, Patricia Bouyer, Daniel Stan

Publication date: 7 December 2021

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

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

Mathematics Subject Classification ID

Games involving graphs (91A43) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Automatic verification of concurrent stochastic systems ⋮ A Note on Game Theory and Verification

Cites Work

• Reexamination of the perfectness concept for equilibrium points in extensive games
• Stay-in-a-set games
• A generalization of Brouwer's fixed point theorem
• Nash Equilibria in Concurrent Games with Büchi Objectives
• Pure Nash Equilibria in Concurrent Deterministic Games
• On Pure Nash Equilibria in Stochastic Games
• Mixed Nash Equilibria in Concurrent Terminal-Reward Games
• The Complexity of Nash Equilibria in Limit-Average Games
• Verifying Team Formation Protocols with Probabilistic Model Checking
• The Complexity of Nash Equilibria in Stochastic Multiplayer Games
• THE FRONTIER OF DECIDABILITY IN PARTIALLY OBSERVABLE RECURSIVE GAMES
• Partial-Observation Stochastic Games
• Computer Science Logic
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Stochastic Games with Perfect Information and Time Average Payoff
• Equilibrium points in n -person games

This page was built for publication: