On the complexity of rational verification

DOI10.1007/s10472-022-09804-3arXiv2207.02637MaRDI QIDQ6133701

Michael Wooldridge, Giuseppe Perelli, Muhammad Najib, Julian Gutierrez

Publication date: 21 August 2023

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

game theorytemporal logicmulti-agent systemsrational verification

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis with rational environments
• Reasoning about equilibria in game-like concurrent systems
• Synthesis of Reactive(1) designs
• Bisection is optimal
• The complexity of mean payoff games on graphs
• Imperfect information in reactive modules games
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• Iterated Boolean games
• From model checking to equilibrium checking: reactive modules for rational verification
• Temporal Specifications with Accumulative Values
• The Complexity of Nash Equilibria in Limit-Average Games
• Alternating-time temporal logic
• Rational Synthesis
• The Complexity of Rational Synthesis
• Deciding parity games in quasipolynomial time
• Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
• Rational Synthesis Under Imperfect Information
• Deterministic generators and games for Ltl fragments

This page was built for publication: On the complexity of rational verification