Solution concepts and algorithms for infinite multiplayer games
From MaRDI portal
Recommendations
Cited in
(23)- Extending finite-memory determinacy to multi-player games
- On equilibria in quantitative games with reachability/safety objectives
- On subgame perfect equilibria in turn-based reachability timed games
- Perfect information games where each player acts only once
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
- A game-theoretic approach for the synthesis of complex systems
- Parameterized games of perfect information
- On the existence of weak subgame perfect equilibria
- Equilibria in multi-player multi-outcome infinite sequential games
- Iterated Boolean games
- Existence of secure equilibrium in multi-player games with perfect information
- 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
- scientific article; zbMATH DE number 7559372 (Why is no real title available?)
- The complexity of subgame perfect equilibria in quantitative reachability games
- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- scientific article; zbMATH DE number 7649921 (Why is no real title available?)
- Equilibrium in two-player stochastic games with shift-invariant payoffs
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
- Implicit quantification for modal reasoning in large games
- Games with -automatic preference relations
This page was built for publication: Solution concepts and algorithms for infinite multiplayer games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599509)
