Implicit quantification for modal reasoning in large games
From MaRDI portal
Cites work
- A logic for diffusion in social networks
- A logical structure for strategies
- Alternating-time temporal logic
- An elementary proof of the completeness of PDL
- Anonymous games with binary actions
- Boolean games with epistemic goals
- Branching time, perfect information games, and backward induction
- Characterization of pure strategy equilibria infinite anonymous games
- Dynamics of choice restriction in large games
- Games, actions and social software. Multidisciplinary aspects
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3880483 (Why is no real title available?)
- scientific article; zbMATH DE number 2063025 (Why is no real title available?)
- Iterated Boolean games
- On the logic of cooperation and propositional control
- Properties of multiwinner voting rules
- Propositional modal logic with implicit modal quantification
- Social network games
- Solution concepts and algorithms for infinite multiplayer games
- Strategies in games: a logic-automata study
- Subgames within large games and the heuristic of imitation
- Symmetries and the complexity of pure Nash equilibrium
- The computational power of population protocols
- The monodic fragment of propositional term modal logic
This page was built for publication: Implicit quantification for modal reasoning in large games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6836087)
