A Note on Game Theory and Verification
From MaRDI portal
Recommendations
- Complexity of Verifying Game Equilibria
- Games for verification: Algorithmic issues
- scientific article; zbMATH DE number 1864595
- Matrix approach to verification of finite multi-potential games
- A game-theoretic framework for specification and verification of cryptographic protocols
- General-sum stochastic games: verifiability conditions for Nash equilibria
- scientific article; zbMATH DE number 687938
- Verification and refutation of probabilistic specifications via games
- A Theory for Game Theories
Cites work
- A stay-in-a-set game without a stationary equilibrium
- Alternating-time temporal logic
- Automata, logics, and infinite games. A guide to current research
- Computer Science Logic
- Constrained existence problem for weak subgame perfect equilibria with -regular Boolean objectives
- Equilibrium points in n -person games
- Game theory. Translated from the Hebrew by Ziv Hellman and edited by Mike Borns
- Games on graphs with a public signal monitoring
- Games with secure equilibria
- scientific article; zbMATH DE number 1903345 (Why is no real title available?)
- Mixed Nash equilibria in concurrent terminal-reward games
- Nash equilibria in concurrent games with Büchi objectives
- Nash equilibria in games over graphs equipped with a communication mechanism
- New complexity results about Nash equilibria
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
- On the existence of weak subgame perfect equilibria
- Partial-observation stochastic games, how to win when belief fails
- Pure Nash equilibria in concurrent deterministic games
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- Robust equilibria in mean-payoff games
- Solution concepts and algorithms for infinite multiplayer games
- Solving simple stochastic tail games
- Stay-in-a-set games
- Stochastic equilibria under imprecise deviations in terminal-reward concurrent games
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- The Complexity of Nash Equilibria in Limit-Average Games
- The complexity of rational synthesis for concurrent games
Cited in
(2)
This page was built for publication: A Note on Game Theory and Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297580)