Bounded-Memory Strategies in Partial-Information Games
Fuente:
arXiv
Guardado en:
| Autores principales: | Bose, Sougata, Ibsen-Jensen, Rasmus, Totzke, Patrick |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
The Power of Counting Steps in Quantitative Games
por: Bose, Sougata, et al.
Publicado: (2024)
por: Bose, Sougata, et al.
Publicado: (2024)
Temporal Explorability Games
por: Austin, Pete, et al.
Publicado: (2024)
por: Austin, Pete, et al.
Publicado: (2024)
Stochastic Games with Limited Public Memory
por: Hansen, Kristoffer Arnsfelt, et al.
Publicado: (2025)
por: Hansen, Kristoffer Arnsfelt, et al.
Publicado: (2025)
Memoryless Strategies in Stochastic Reachability Games
por: Kiefer, Stefan, et al.
Publicado: (2024)
por: Kiefer, Stefan, et al.
Publicado: (2024)
The Complexity of Games with Randomised Control
por: Bahmani, Sarvin, et al.
Publicado: (2026)
por: Bahmani, Sarvin, et al.
Publicado: (2026)
Generalised Reachability Games Revisited
por: Bose, Sougata, et al.
Publicado: (2025)
por: Bose, Sougata, et al.
Publicado: (2025)
Parity Games on Temporal Graphs
por: Austin, Pete, et al.
Publicado: (2023)
por: Austin, Pete, et al.
Publicado: (2023)
Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games
por: Kiefer, Stefan, et al.
Publicado: (2024)
por: Kiefer, Stefan, et al.
Publicado: (2024)
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games
por: Kiefer, Stefan, et al.
Publicado: (2022)
por: Kiefer, Stefan, et al.
Publicado: (2022)
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
por: Main, James C. A.
Publicado: (2023)
por: Main, James C. A.
Publicado: (2023)
Incentive Designs for Stackelberg Games with a Large Number of Followers and their Mean-Field Limits
por: Sanjari, Sina, et al.
Publicado: (2022)
por: Sanjari, Sina, et al.
Publicado: (2022)
Constant-Memory Strategies in Stochastic Games: Best Responses and Equilibria
por: Zhu, Fengming, et al.
Publicado: (2025)
por: Zhu, Fengming, et al.
Publicado: (2025)
Strong Equilibria in Bayesian Games with Bounded Group Size
por: Han, Qishen, et al.
Publicado: (2025)
por: Han, Qishen, et al.
Publicado: (2025)
Universal Complexity Bounds Based on Value Iteration for Stochastic Mean Payoff Games and Entropy Games
por: Allamigeon, Xavier, et al.
Publicado: (2022)
por: Allamigeon, Xavier, et al.
Publicado: (2022)
Mixed Strategy Constraints in Continuous Games
por: Krusniak, Mel, et al.
Publicado: (2024)
por: Krusniak, Mel, et al.
Publicado: (2024)
Playing Stochastically in Weighted Timed Games to Emulate Memory
por: Monmege, Benjamin, et al.
Publicado: (2021)
por: Monmege, Benjamin, et al.
Publicado: (2021)
A Lower Bound on Swap Regret in Extensive-Form Games
por: Daskalakis, Constantinos, et al.
Publicado: (2024)
por: Daskalakis, Constantinos, et al.
Publicado: (2024)
Bridging the Gap between Partially Observable Stochastic Games and Sparse POMDP Methods
por: Becker, Tyler, et al.
Publicado: (2024)
por: Becker, Tyler, et al.
Publicado: (2024)
Commitment to Sparse Strategies in Two-Player Games
por: Afiouni, Salam, et al.
Publicado: (2024)
por: Afiouni, Salam, et al.
Publicado: (2024)
Efficient Stackelberg Strategies for Finitely Repeated Games
por: Collina, Natalie, et al.
Publicado: (2022)
por: Collina, Natalie, et al.
Publicado: (2022)
Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games
por: Zhang, Brian Hu, et al.
Publicado: (2024)
por: Zhang, Brian Hu, et al.
Publicado: (2024)
(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
por: Anagnostides, Ioannis, et al.
Publicado: (2026)
HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms
por: Yan, Rui, et al.
Publicado: (2024)
por: Yan, Rui, et al.
Publicado: (2024)
Exploring Equilibrium Strategies in Network Games with Generative AI
por: Yang, Yaoqi, et al.
Publicado: (2024)
por: Yang, Yaoqi, et al.
Publicado: (2024)
Synthesis of Robust Optimal Strategies in Weighted Timed Games
por: Monmege, Benjamin, et al.
Publicado: (2024)
por: Monmege, Benjamin, et al.
Publicado: (2024)
Distance Preservation Games
por: Aziz, Haris, et al.
Publicado: (2025)
por: Aziz, Haris, et al.
Publicado: (2025)
Synthesizing Permissive Winning Strategy Templates for Parity Games
por: Anand, Ashwani, et al.
Publicado: (2023)
por: Anand, Ashwani, et al.
Publicado: (2023)
A Resource Allocation Game and its Equilibrium Strategies
por: Lee, Duan-Shin
Publicado: (2026)
por: Lee, Duan-Shin
Publicado: (2026)
Solving Infinite-Player Games with Player-to-Strategy Networks
por: Martin, Carlos, et al.
Publicado: (2025)
por: Martin, Carlos, et al.
Publicado: (2025)
Concurrent Strategies on Games with Algebras
por: Huriot-Tattegrain, Sacha, et al.
Publicado: (2024)
por: Huriot-Tattegrain, Sacha, et al.
Publicado: (2024)
Selling Information in Games with Externalities
por: Falconer, Thomas, et al.
Publicado: (2025)
por: Falconer, Thomas, et al.
Publicado: (2025)
Games on Graphs: From Logic and Automata to Algorithms
por: Fijalkow, Nathanaël, et al.
Publicado: (2023)
por: Fijalkow, Nathanaël, et al.
Publicado: (2023)
Fast Strategy Solving for the Informed Player in Two-Player Zero-Sum Linear-Quadratic Differential Games with One-Sided Information
por: Ghimire, Mukesh, et al.
Publicado: (2026)
por: Ghimire, Mukesh, et al.
Publicado: (2026)
Computational Modelling for Combinatorial Game Strategies
por: Diaconescu, Răzvan
Publicado: (2024)
por: Diaconescu, Răzvan
Publicado: (2024)
Integrated Resource Allocation and Strategy Synthesis in Safety Games on Graphs with Deception
por: Kulkarni, Abhishek N., et al.
Publicado: (2024)
por: Kulkarni, Abhishek N., et al.
Publicado: (2024)
Deception in Differential Games: Information Limiting Strategy to Induce Dilemma
por: Shishika, Daigo, et al.
Publicado: (2024)
por: Shishika, Daigo, et al.
Publicado: (2024)
Improved Amenability Bounds for Local Coordination Games
por: Peretz, Ron, et al.
Publicado: (2026)
por: Peretz, Ron, et al.
Publicado: (2026)
Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line
por: Lu, Pinyan, et al.
Publicado: (2024)
por: Lu, Pinyan, et al.
Publicado: (2024)
Understanding Optimal Portfolios of Strategies for Solving Two-player Zero-sum Games
por: Drabent, Karolina, et al.
Publicado: (2025)
por: Drabent, Karolina, et al.
Publicado: (2025)
A Non-Zero-Sum Game Model for Optimal Cyber Defense Strategies
por: Park, Dongyoung, et al.
Publicado: (2025)
por: Park, Dongyoung, et al.
Publicado: (2025)
Ejemplares similares
-
The Power of Counting Steps in Quantitative Games
por: Bose, Sougata, et al.
Publicado: (2024) -
Temporal Explorability Games
por: Austin, Pete, et al.
Publicado: (2024) -
Stochastic Games with Limited Public Memory
por: Hansen, Kristoffer Arnsfelt, et al.
Publicado: (2025) -
Memoryless Strategies in Stochastic Reachability Games
por: Kiefer, Stefan, et al.
Publicado: (2024) -
The Complexity of Games with Randomised Control
por: Bahmani, Sarvin, et al.
Publicado: (2026)