Reasoning about equilibria in game-like concurrent systems
From MaRDI portal
Publication:345709
Recommendations
Cites work
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3880483 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1241700 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1759605 (Why is no real title available?)
- A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
- A course in game theory.
- Algorithmic Game Theory
- Alternating-time temporal logic
- An automata-theoretic approach to branching-time model checking
- Characterizing finite Kripke structures in propositional temporal logic
- Decision procedures and expressiveness in the temporal logic of branching time
- Expressiveness and complexity results for strategic reasoning
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Handbook of modal logic
- Iterated Boolean games
- On the boundary of behavioral strategies
- On the complexity of the linear-time μ-calculus for Petri Nets
- PRISM-games: a model checker for stochastic multi-player games
- Playing games with boxes and diamonds.
- Reasoning about strategies
- Relentful strategic reasoning in alternating-time temporal logic
- Results on the propositional \(\mu\)-calculus
- Strategy logic
- The Complexity of Nash Equilibria in Limit-Average Games
- The complexity of Nash equilibria in stochastic multiplayer games
- The complexity of computing a Nash equilibrium
- The complexity of propositional linear temporal logics
- Unfoldings: A partial-order approach to model checking.
- What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
- “Sometimes” and “not never” revisited
Cited in
(21)- A characterization of mixed-strategy Nash equilibria in PCTL augmented with a cost quantifier
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Equilibria of concurrent games on event structures
- Deterministic Negotiations: Concurrency for Free
- Verification of multi-agent systems with public actions against strategy logic
- Equilibria for games with combined qualitative and quantitative objectives
- Multi-player equilibria verification for concurrent stochastic games
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- On the complexity of rational verification
- A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
- Correlated equilibria and fairness in concurrent stochastic games
- Multi-player games with LDL goals over finite traces
- Model Checking Strategic Equilibria
- Graded modalities in strategy logic
- Incentive Engineering for Concurrent Games
- From model checking to equilibrium checking: reactive modules for rational verification
- Reasoning About Substructures and Games
- A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
- Nash equilibrium and bisimulation invariance
- Expressiveness and complexity results for strategic reasoning
- scientific article; zbMATH DE number 7136658 (Why is no real title available?)
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)
