scientific article; zbMATH DE number 7649930

DOI10.4230/LIPIcs.CONCUR.2019.22MaRDI QIDQ5875383

Julian Gutierrez, Giuseppe Perelli, Michael Wooldridge, Muhammad Najib

Publication date: 3 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

synthesisNash equilibriummodel checkingtemporal logicgames

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Automatic verification of concurrent stochastic systems ⋮ Incentive Engineering for Concurrent Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis with rational environments
• Incentive engineering for Boolean games
• Synthesis of Reactive(1) designs
• The complexity of facets (and some facets of complexity)
• The complexity of optimization problems
• The complexity of mean payoff games on graphs
• Energy parity games
• The complexity of multi-mean-payoff and multi-energy games
• Iterated Boolean games
• From model checking to equilibrium checking: reactive modules for rational verification
• Generalized Mean-payoff and Energy Games
• Pure Nash Equilibria in Concurrent Deterministic Games
• Temporal Specifications with Accumulative Values
• The Computational Complexity of Structure-Based Causality
• The Complexity of Nash Equilibria in Limit-Average Games
• Rational Synthesis
• Energy and Mean-Payoff Games with Imperfect Information
• On the complexity of unique solutions
• Synthesis from LTL Specifications with Mean-Payoff Objectives
• Game Theory