Rational Behaviour and Strategy Construction in Infinite Multiplayer Games

DOI10.1007/11944836_21MaRDI QIDQ5385987zbMATH OpenOpenAlexFDO

Authors Michael Ummels

Publication date 17 April 2008

Published in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11944836_21

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) (n)-person games, (n>2) (91A06) Rationality and learning in game theory (91A26) Games involving graphs (91A43)

Recommendations

• Solution concepts and algorithms for infinite multiplayer games
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Subgame perfection for equilibria in quantitative reachability games
• On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
• Subgame perfection in recursive perfect information games

Cited in

(27)

• Graded modalities in strategy logic
• On subgame perfect equilibria in turn-based reachability timed games
• Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
• A game-theoretic approach for the synthesis of complex systems
• On the existence of weak subgame perfect equilibria
• Equilibria in multi-player multi-outcome infinite sequential games
• Iterated Boolean games
• On the existence of weak subgame perfect equilibria
• A Note on Game Theory and Verification
• Constrained existence problem for weak subgame perfect equilibria with -regular Boolean objectives
• Incentive Stackelberg mean-payoff games
• On the synthesis of strategies in infinite games
• Solution concepts and algorithms for infinite multiplayer games
• Nash equilibria in games over graphs equipped with a communication mechanism
• The complexity of subgame perfect equilibria in quantitative reachability games
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• scientific article; zbMATH DE number 7649921 (Why is no real title available?)
• Subgame-perfect Equilibria in Mean-payoff Games (journal version)
• Stackelberg-Pareto synthesis
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• Arena-independent memory bounds for Nash equilibria in reachability games
• Arena-independent memory bounds for Nash equilibria in reachability games
• Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
• A rational way of playing: revision theory for strategic interaction
• Permissive equilibria in multiplayer reachability games
• The non-cooperative rational synthesis problem for SPEs and -regular objectives
• Verification of multi-agent systems with public actions against strategy logic

This page was built for publication: Rational Behaviour and Strategy Construction in Infinite Multiplayer Games

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