:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Trencsenyi, Vince
Format:	Preprint
Published:	2025
Subjects:	Artificial Intelligence Formal Languages and Automata Theory Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2512.11942
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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)

Computing Threshold Budgets in Discrete-Bidding Games
by: Avni, Guy, 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)

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)

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

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

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)

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)

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)

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

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

Approximating Human Strategic Reasoning with LLM-Enhanced Recursive Reasoners Leveraging Multi-agent Hypergames
by: Trencsenyi, Vince, et al.
Published: (2025)

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

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

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

Enforcing Temporal Constraints for LLM Agents
by: Kamath, Adharsh, et al.
Published: (2025)

Good-for-MDP State Reduction for Stochastic LTL Planning
by: Weinhuber, Christoph, et al.
Published: (2025)

Are Agents Probabilistic Automata? A Trace-Based, Memory-Constrained Theory of Agentic AI
by: Koohestani, Roham, et al.
Published: (2025)

Learning Probabilistic Temporal Logic Specifications for Stochastic Systems
by: Roy, Rajarshi, et al.
Published: (2025)

What is Formal Verification without Specifications? A Survey on mining LTL Specifications
by: Neider, Daniel, et al.
Published: (2025)

Subtyping in DHOL -- Extended preprint
by: Rothgang, Colin, et al.
Published: (2025)

Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
by: Hausmann, Daniel, et al.
Published: (2025)

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

About Time: Model-free Reinforcement Learning with Timed Reward Machines
by: Roy, Rajarshi, et al.
Published: (2025)

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
by: Aminof, Benjamin, et al.
Published: (2024)

Temporal Ensemble Logic
by: Zhang, Guo-Qiang
Published: (2024)

Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning
by: Chakraborty, Debraj, et al.
Published: (2026)