Cover Image

Taming Infinity one Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ajdarów, Michal, Main, James C. A., Novotný, Petr, Randour, Mickael
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Artificial Intelligence Formal Languages and Automata Theory Logic in Computer Science Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Mixing Any Cocktail with Limited Ingredients: On the Structure of Payoff Sets in Multi-Objective POMDPs and its Impact on Randomised Strategies
by: Main, James C. A., et al.
Published: (2025)

Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem under Finite-Memory Assumptions
by: Main, James C. A., et al.
Published: (2022)

Half-Positional Objectives Recognized by Deterministic Büchi Automata
by: Bouyer, Patricia, et al.
Published: (2022)

Arena-Independent Finite-Memory Determinacy in Stochastic Games
by: Bouyer, Patricia, et al.
Published: (2021)

Simplicity Lies in the Eye of the Beholder: A Strategic Perspective on Controllers in Reactive Synthesis
by: Randour, Mickael
Published: (2025)

Games on Graphs: From Logic and Automata to Algorithms
by: Fijalkow, Nathanaël, et al.
Published: (2023)

On the Existence of Reactive Strategies Resilient to Delay
by: Fränzle, Martin, et al.
Published: (2023)

The Power of Counting Steps in Quantitative Games
by: Bose, Sougata, et al.
Published: (2024)

Reasoning about Strategic Abilities in Stochastic Multi-agent Systems
by: Zhang, Yedi, et al.
Published: (2024)

Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)

On Good-for-MDPs Automata
by: Schewe, Sven, et al.
Published: (2022)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2026)

Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives
by: De Giacomo, Giuseppe, et al.
Published: (2025)

A positional $\mathbfΠ^0_3$-complete objective
by: Casares, Antonio, et al.
Published: (2024)

Behavioural pseudometrics for continuous-time diffusions
by: Chen, Linan, et al.
Published: (2023)

Bisimulation for Feller-Dynkin Processes
by: Chen, Linan, et al.
Published: (2019)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
by: Bhaduri, Purandar
Published: (2025)

Efficient Analysis of Polynomial Asymptotic Estimates for VASS MDPs
by: Ajdarów, Michal
Published: (2025)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
by: Shakiba, Yousef, et al.
Published: (2025)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
by: Fernau, Henning, et al.
Published: (2024)

Comparing Labeled Markov Chains: A Cantor-Kantorovich Approach
by: Banse, Adrien, et al.
Published: (2025)

The Complexity of Nested Reset Counter Systems
by: Balasubramanian, A. R., et al.
Published: (2026)

Random Deterministic Automata With One Added Transition
by: Carayol, Arnaud, et al.
Published: (2024)

Continuous Pushdown VASS in One Dimension are Easy
by: Perez, Guillermo A., et al.
Published: (2024)

Generalised Quantifiers Based on Rabin-Mostowski Index
by: Kuperberg, Denis, et al.
Published: (2026)

Negated String Containment is Decidable (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2025)

A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
by: Doveri, Kyveli, et al.
Published: (2026)

String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2025)

Extended CTG Generalization and Dynamic Adjustment of Generalization Strategies in IC3
by: Su, Yuheng, et al.
Published: (2025)

A Unifying Framework for Global Optimization: From Theory to Formalization
by: Serré, Gaëtan, et al.
Published: (2025)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)

An Automata-Based Approach to Games with $ω$-Automatic Preferences
by: Bruyère, Véronique, et al.
Published: (2026)

Non-cooperative rational synthesis problem for probabilistic strategies
by: Koide, So, et al.
Published: (2024)

Faster and Smaller Solutions of Obliging Games
by: Hausmann, Daniel, et al.
Published: (2024)

Computing Threshold Budgets in Discrete-Bidding Games
by: Avni, Guy, et al.
Published: (2022)

Complexity of the Existence of Constrained Secure Equilibria in Multi-Player Games
by: Mizuno, Hiroki, et al.
Published: (2025)

Playing Safe, Ten Years Later
by: Colcombet, Thomas, et al.
Published: (2022)

Distributed Fair Assignment and Rebalancing for Mobility-on-Demand Systems via an Auction-based Method
by: Liang, Kaier, et al.
Published: (2024)