Reasoning about equilibria in game-like concurrent systems

DOI10.1016/j.apal.2016.10.009zbMath1400.03057OpenAlexW2530905289MaRDI QIDQ345709

Paul Harrenstein, Michael Wooldridge, Julian Gutierrez

Publication date: 2 December 2016

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2016.10.009

zbMATH Keywords

model checkingtemporal logicmulti-player gamesstrategic reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Other game-theoretic models (91A40) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (9)

Graded modalities in strategy logic ⋮ Unnamed Item ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Reasoning About Substructures and Games ⋮ On the complexity of rational verification ⋮ Incentive Engineering for Concurrent Games ⋮ Automated temporal equilibrium analysis: verification and synthesis of multi-player games ⋮ Unnamed Item ⋮ Verification of multi-agent systems with public actions against strategy logic

Uses Software

• MCMAS
• PRISM-games
• MOCHA
• EAGLE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Strategy logic
• Characterizing finite Kripke structures in propositional temporal logic
• Decision procedures and expressiveness in the temporal logic of branching time
• Iterated Boolean games
• Unfoldings: A partial-order approach to model checking.
• A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
• What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
• The complexity of computing a Nash equilibrium
• Relentful Strategic Reasoning in Alternating-Time Temporal Logic
• The Complexity of Nash Equilibria in Limit-Average Games
• The Complexity of Nash Equilibria in Stochastic Multiplayer Games
• Alternating-time temporal logic
• “Sometimes” and “not never” revisited
• The complexity of propositional linear temporal logics
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• On the Boundary of Behavioral Strategies
• PRISM-games: A Model Checker for Stochastic Multi-Player Games
• An automata-theoretic approach to branching-time model checking
• Algorithmic Game Theory
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Reasoning about equilibria in game-like concurrent systems