Reasoning about equilibria in game-like concurrent systems

DOI10.1016/J.APAL.2016.10.009zbMATH Open1400.03057OpenAlexW2530905289MaRDI QIDQ345709FDOQ345709

Authors: Julian Gutiérrez, Paul Harrenstein, M. J. Wooldridge 

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

Recommendations

• Expressiveness and complexity results for strategic reasoning
• Model Checking Strategic Equilibria
• Equilibria for games with combined qualitative and quantitative objectives
• Strategy logic
• Strategy Logic

zbMATH Keywords

model checkingtemporal logicmulti-player gamesstrategic reasoning

Mathematics Subject Classification ID

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

Cites Work

• PRISM-games: A Model Checker for Stochastic Multi-Player Games
• A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
• Algorithmic Game Theory
• Characterizing finite Kripke structures in propositional temporal logic
• Alternating-time temporal logic
• Title not available (Why is that?)
• A course in game theory.
• The complexity of propositional linear temporal logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of modal logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Results on the propositional \(\mu\)-calculus
• Decision procedures and expressiveness in the temporal logic of branching time
• “Sometimes” and “not never” revisited
• An automata-theoretic approach to branching-time model checking
• Reasoning about strategies
• What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
• The complexity of Nash equilibria in stochastic multiplayer games
• Iterated Boolean games
• Unfoldings: A partial-order approach to model checking.
• The complexity of computing a Nash equilibrium
• Relentful strategic reasoning in alternating-time temporal logic
• The Complexity of Nash Equilibria in Limit-Average Games
• Title not available (Why is that?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• On the Boundary of Behavioral Strategies
• Playing games with boxes and diamonds.
• On the complexity of the linear-time μ-calculus for Petri Nets
• Strategy logic

Cited In (17)

• On the complexity of rational verification
• A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
• A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
• Model Checking Strategic Equilibria
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• Incentive Engineering for Concurrent Games
• Title not available (Why is that?)
• Multi-player equilibria verification for concurrent stochastic games
• From model checking to equilibrium checking: reactive modules for rational verification
• Reasoning About Substructures and Games
• A characterization of mixed-strategy Nash equilibria in PCTL augmented with a cost quantifier
• Verification of multi-agent systems with public actions against strategy logic
• Deterministic Negotiations: Concurrency for Free
• Title not available (Why is that?)
• Correlated equilibria and fairness in concurrent stochastic games
• Graded modalities in strategy logic

Uses Software

• MCMAS
• PRISM-games
• MOCHA
• EAGLE

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

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