Mean-payoff games with \(\omega\)-regular specifications
From MaRDI portal
Publication:2669180
DOI10.3390/g13010019zbMath1484.91080OpenAlexW4211210236MaRDI QIDQ2669180
Michael Wooldridge, Thomas Steeples, Julian Gutierrez
Publication date: 9 March 2022
Published in: Games (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/g13010019
game theorytemporal logicequilibriamulti-agent systemsautomated verificationmulti-player gamesmean-payoff games
Noncooperative games (91A10) Cooperative games (91A12) 2-person games (91A05) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of stochastic \(\omega \)-regular games
- Synthesis of Reactive(1) designs
- Acceptable points in games of perfect information
- On total functions, existence theorems and computational complexity
- Equilibria for games with combined qualitative and quantitative objectives
- Positional strategies for mean payoff games
- A characterization of the minimum cycle mean in a digraph
- The complexity of mean payoff games on graphs
- Pareto curves of multidimensional mean-payoff games
- Modalities for model checking: Branching time logic strikes back
- The complexity of multi-mean-payoff and multi-energy games
- Iterated Boolean games
- From model checking to equilibrium checking: reactive modules for rational verification
- Non-cooperative games
- The Complexity of Nash Equilibria in Limit-Average Games
- Alternating-time temporal logic
- Half-Positional Determinacy of Infinite Games
- The complexity of propositional linear temporal logics
- Provably Difficult Combinatorial Games
- Reducibility among Combinatorial Problems
- The Core of an N Person Game
- Some theorems on the core of ann-Game without Side-Payments
- Equilibrium points in n -person games
This page was built for publication: Mean-payoff games with \(\omega\)-regular specifications
