Image de couverture de livre

Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem under Finite-Memory Assumptions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Main, James C. A., Randour, Mickael
Format:	Preprint
Publié:	2022
Sujets:	Computer Science and Game Theory Formal Languages and Automata Theory Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Arena-Independent Finite-Memory Determinacy in Stochastic Games
par: Bouyer, Patricia, et autres
Publié: (2021)

Taming Infinity one Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs
par: Ajdarów, Michal, et autres
Publié: (2025)

Half-Positional Objectives Recognized by Deterministic Büchi Automata
par: Bouyer, Patricia, et autres
Publié: (2022)

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

Games on Graphs: From Logic and Automata to Algorithms
par: Fijalkow, Nathanaël, et autres
Publié: (2023)

On the Existence of Reactive Strategies Resilient to Delay
par: Fränzle, Martin, et autres
Publié: (2023)

The Power of Counting Steps in Quantitative Games
par: Bose, Sougata, et autres
Publié: (2024)

Reasoning about Strategic Abilities in Stochastic Multi-agent Systems
par: Zhang, Yedi, et autres
Publié: (2024)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
par: Fernau, Henning, et autres
Publié: (2024)

A positional $\mathbfΠ^0_3$-complete objective
par: Casares, Antonio, et autres
Publié: (2024)

The Queue Automaton Revisited
par: Baeten, Jos C. M., et autres
Publié: (2025)

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
par: Bhaduri, Purandar
Publié: (2025)

Parikh's Theorem Made Symbolic
par: Hague, Matthew, et autres
Publié: (2023)

A Dichotomy Theorem for Automatic Structures
par: Cuvelier, Antoine, et autres
Publié: (2026)

Monitoring Timed Properties (Revisited)
par: Grosen, Thomas Møller, et autres
Publié: (2022)

A Completeness Theorem for Probabilistic Regular Expressions
par: Różowski, Wojciech, et autres
Publié: (2023)

Parikh Automata on Finite and Infinite Words
par: Grobler, Mario, et autres
Publié: (2023)

DTMC Model Checking by Path Abstraction Revisited (extended version)
par: Hartmanns, Arnd, et autres
Publié: (2025)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
par: Bollig, Benedikt, et autres
Publié: (2025)

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
par: Finkbeiner, Bernd, et autres
Publié: (2026)

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
par: Holík, Lukáš, et autres
Publié: (2025)

Randomise Alone, Reach as a Team
par: Brice, Léonard, et autres
Publié: (2026)

Extended CTG Generalization and Dynamic Adjustment of Generalization Strategies in IC3
par: Su, Yuheng, et autres
Publié: (2025)

Computing Threshold Budgets in Discrete-Bidding Games
par: Avni, Guy, et autres
Publié: (2022)

Playing Safe, Ten Years Later
par: Colcombet, Thomas, et autres
Publié: (2022)

An Automata-Based Approach to Games with $ω$-Automatic Preferences
par: Bruyère, Véronique, et autres
Publié: (2026)

Non-cooperative rational synthesis problem for probabilistic strategies
par: Koide, So, et autres
Publié: (2024)

Faster and Smaller Solutions of Obliging Games
par: Hausmann, Daniel, et autres
Publié: (2024)

Complexity of the Existence of Constrained Secure Equilibria in Multi-Player Games
par: Mizuno, Hiroki, et autres
Publié: (2025)

Distributed Fair Assignment and Rebalancing for Mobility-on-Demand Systems via an Auction-based Method
par: Liang, Kaier, et autres
Publié: (2024)

Sequential Decision Making in Stochastic Games with Incomplete Preferences over Temporal Objectives
par: Kulkarni, Abhishek Ninad, et autres
Publié: (2025)

A complete formalization of Fermat's Last Theorem for regular primes in Lean
par: Best, Alex, et autres
Publié: (2024)

Fibrational Perspectives on Determinization of Finite-State Automata
par: Li, Thea
Publié: (2024)

Decision Questions for Probabilistic Automata on Small Alphabets
par: Bell, Paul C., et autres
Publié: (2021)

Positive First-order Logic on Words and Graphs
par: Kuperberg, Denis
Publié: (2022)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
par: Rooduijn, Jan, et autres
Publié: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
par: Das, Anupam, et autres
Publié: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

An algebraic theory of ω-regular languages, via μν-expressions
par: Das, Anupam, et autres
Publié: (2025)