Reasoning in large games with unboundedly many players

DOI10.1007/978-3-030-88708-7_4OpenAlexW3202740137MaRDI QIDQ2148813

Yanyan Li

Publication date: 24 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88708-7_4

zbMATH Keywords

modal logicdecidabilitylarge gamesimprovement dynamicsstrategy distributions

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Symmetries and the complexity of pure Nash equilibrium
• An elementary proof of the completeness of PDL
• Anonymous games with binary actions
• Characterization of pure strategy equilibria infinite anonymous games
• The computational power of population protocols
• The monodic fragment of propositional term modal logic
• Subgames within large games and the heuristic of imitation
• A logic for diffusion in social networks
• Properties of multiwinner voting rules
• Strategies in Games: A Logic-Automata Study
• Alternating-time temporal logic
• Social network games
• DYNAMICS OF CHOICE RESTRICTION IN LARGE GAMES
• Branching time, perfect information games, and backward induction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reasoning in large games with unboundedly many players