Cover Image

Playing Safe, Ten Years Later

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Colcombet, Thomas, Fijalkow, Nathanaël, Horn, Florian
Format:	Preprint
Published:	2022
Subjects:	Computer Science and Game Theory Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
by: Casares, Antonio, et al.
Published: (2023)

Hypergame Rationalisability: Solving Agent Misalignment In Strategic Play
by: Trencsenyi, Vince
Published: (2025)

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

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

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)

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

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

Sequential Decision Making in Stochastic Games with Incomplete Preferences over Temporal Objectives
by: Kulkarni, Abhishek Ninad, et al.
Published: (2025)

Cost Automata, Safe Schemes, and Downward Closures
by: Barozzini, David, et al.
Published: (2020)

Expregular functions
by: Colcombet, Thomas, et al.
Published: (2026)

Admissibility Over Winning: A New Approach to Reactive Synthesis in Robotics
by: Muvvala, Karan, et al.
Published: (2024)

Randomise Alone, Reach as a Team
by: Brice, Léonard, et al.
Published: (2026)

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

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

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)

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

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

Mean-payoff and Energy Discrete Bidding Games
by: Avni, Guy, et al.
Published: (2025)

Equilibria in Multiplayer Graph Games: An Algorithmic Study
by: Brice, Léonard
Published: (2026)

Auction-Based Scheduling
by: Avni, Guy, et al.
Published: (2023)

LTL$_f$ Learning Meets Boolean Set Cover
by: Bathie, Gabriel, et al.
Published: (2025)

Reach together: How populations win repeated games
by: Bertrand, Nathalie, et al.
Published: (2025)

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

Computing the Reachability Value of Posterior-Deterministic POMDPs
by: Fijalkow, Nathanaël, et al.
Published: (2026)

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
by: Raha, Ritam, et al.
Published: (2021)

Taming Infinity one Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs
by: Ajdarów, Michal, et al.
Published: (2025)

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)

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

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
by: Bueri, Lucas, et al.
Published: (2024)

Tree-Verifiable Graph Grammars
by: Chimes, Mark, et al.
Published: (2024)

Adversarial Synchronization
by: Lipin, Anton E., et al.
Published: (2026)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

Attractors Is All You Need: Parity Games In Polynomial Time
by: van der Heijden, Rick
Published: (2025)

An algebraic characterisation of Eve-positional languages
by: Colcombet, Thomas, et al.
Published: (2026)

Resolving Nondeterminism with Randomness
by: Henzinger, Thomas A., et al.
Published: (2025)