Iterated Boolean games

DOI10.1016/J.IC.2015.03.011MaRDI QIDQ2346405zbMATH OpenOpenAlexFDO

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

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

Mathematics Subject Classification ID

Temporal logic (03B44) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Noncooperative games (91A10) Multistage and repeated games (91A20) Decision theory for games (91A35)

Recommendations

• Boolean network games and iterated Boolean games
• Logics in Artificial Intelligence
• Relaxing exclusive control in Boolean games
• The complexity of decision problems about equilibria in two-player Boolean games
• Dependencies between players in Boolean games

Cites work

• “Sometimes” and “not never” revisited
• A course in game theory.
• A survey of stochastic -regular games
• Decision Problems for Nash Equilibria in Stochastic Games
• Dependencies between players in Boolean games
• Environment Assumptions for Synthesis
• scientific article; zbMATH DE number 4085004 (Why is no real title available?)
• scientific article; zbMATH DE number 54099 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 592673 (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?)
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• Rational synthesis
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Results on the propositional \(\mu\)-calculus
• Solution concepts and algorithms for infinite multiplayer games
• The Complexity of Nash Equilibria in Limit-Average Games
• The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
• The complexity of propositional linear temporal logics

Cited in

(28)

• An abstraction-refinement methodology for reasoning about network games
• Computation as social agency: what, how and who
• Imperfect information in reactive modules games
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• Multi-player games with LDL goals over finite traces
• Natural strategic ability
• From model checking to equilibrium checking: reactive modules for rational verification
• Mean-payoff games with \(\omega\)-regular specifications
• Cooperative concurrent games
• Boolean games with currency
• Reasoning about equilibria in game-like concurrent systems
• Boolean Game with Prioritized Norms
• Boolean network games and iterated Boolean games
• scientific article; zbMATH DE number 7136658 (Why is no real title available?)
• Relaxing exclusive control in Boolean games
• Nash equilibrium and bisimulation invariance
• Equilibrium design for concurrent games
• Good-for-Game QPTL: An Alternating Hodges Semantics
• Who should be my friends? Social balance from the perspective of game theory
• Taming strategy logic: non-recurrent fragments
• On the complexity of rational verification
• Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention
• Local fact change logic
• Implicit quantification for modal reasoning in large games
• Characterising and verifying the core in concurrent multi-player mean-payoff games
• Designing equilibria in concurrent games with social welfare and temporal logic constraints
• Finitely defined preference and preference indiscernibility in ATL with strategy contexts
• Equilibria for games with combined qualitative and quantitative objectives

This page was built for publication: Iterated Boolean games

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