Verification with common knowledge of rationality for graph games

DOI10.1007/978-3-031-77019-7_14MaRDI QIDQ6979819zbMATH OpenFDO

Authors Rindo Nakanishi, Yoshiaki Takata, Hiroyuki Seki

Publication date 23 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-77019-7_14

zbMATH Keywords

common knowledge of rationalitygraph gameepistemic model

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1864595 (Why is no real title available?)
• Epistemic Conditions for Nash Equilibrium
• Epistemic Conditions for Nash Equilibrium, and Common Knowledge of Rationality
• Graph Games and Reactive Synthesis
• On the complexity of rational verification
• Pareto-rational verification
• Rational synthesis
• Rational verification for Nash and subgame-perfect equilibria in graph games
• Solving Sequential Conditions by Finite-State Strategies
• Synthesis with rational environments
• Synthesizing protocols for digital contract signing
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• The complexity of LTL rational synthesis
• The complexity of rational synthesis

This page was built for publication: Verification with common knowledge of rationality for graph games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979819)