Iterated Boolean games
From MaRDI portal
Publication:2346405
DOI10.1016/j.ic.2015.03.011zbMath1318.91012OpenAlexW2057905493MaRDI QIDQ2346405
Paul Harrenstein, Michael Wooldridge, Julian Gutierrez
Publication date: 1 June 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.03.011
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Formal languages and automata (68Q45) Multistage and repeated games (91A20) Temporal logic (03B44) Decision theory for games (91A35)
Related Items (20)
Equilibria for games with combined qualitative and quantitative objectives ⋮ An abstraction-refinement methodology for reasoning about network games ⋮ Computation as social agency: what, how and who ⋮ Imperfect information in reactive modules games ⋮ Boolean Network Games and Iterated Boolean Games ⋮ Reasoning about equilibria in game-like concurrent systems ⋮ Unnamed Item ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Mean-payoff games with \(\omega\)-regular specifications ⋮ Taming strategy logic: non-recurrent fragments ⋮ Cooperative concurrent games ⋮ On the complexity of rational verification ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Automated temporal equilibrium analysis: verification and synthesis of multi-player games ⋮ Multi-player games with LDL goals over finite traces ⋮ Natural strategic ability ⋮ Unnamed Item ⋮ Who should be my friends? Social balance from the perspective of game theory ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics
Cites Work
- A survey of stochastic \(\omega \)-regular games
- Results on the propositional \(\mu\)-calculus
- Dependencies between players in Boolean games
- Reexamination of the perfectness concept for equilibrium points in extensive games
- The Complexity of Nash Equilibria in Limit-Average Games
- Environment Assumptions for Synthesis
- Rational Synthesis
- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
- Decision Problems for Nash Equilibria in Stochastic Games
- “Sometimes” and “not never” revisited
- The complexity of propositional linear temporal logics
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Iterated Boolean games