HSVI can solve zero-sum partially observable stochastic games
From MaRDI portal
Publication:6624522
DOI10.1007/S13235-023-00519-6MaRDI QIDQ6624522
Aurélien Delage, Abdallah Saffidine, Olivier Buffet, Jilles Steeve Dibangoye
Publication date: 25 October 2024
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Noncooperative games (91A10) 2-person games (91A05) Dynamic programming (90C39) Stochastic games, stochastic differential games (91A15) Games with incomplete information, Bayesian games (91A27)
Cites Work
- Title not available (Why is that?)
- Zero-sum stochastic games with partial information
- Efficient computation of behavior strategies
- Faster algorithms for extensive-form game solving via improved smoothing functions
- Optimal control of Markov processes with incomplete state information
- Real-time heuristic search
- Value functions for depth-limited solving in zero-sum imperfect-information games
- Optimally solving Dec-POMDPs as continuous-state MDPs
- Fast algorithms for finding randomized strategies in game trees
- An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information
- Revisiting CFR+ and Alternating Updates
- Smoothing Techniques for Computing Nash Equilibria of Sequential Games
- Finite- and Infinite-Horizon Shapley Games with Nonsymmetric Partial Observation
- DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
- Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
- Partial-Observation Stochastic Games
- The Complexity of Decentralized Control of Markov Decision Processes
- Dynamic games with hidden actions and hidden states
- Zur Theorie der Gesellschaftsspiele.
- Solving zero-sum one-sided partially observable stochastic games
This page was built for publication: HSVI can solve zero-sum partially observable stochastic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624522)
