Cover Image

Synthesizing Permissive Winning Strategy Templates for Parity Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anand, Ashwani, Nayak, Satya Prakash, Schmuck, Anne-Kathrin
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Contract-Based Distributed Synthesis in Two-Objective Parity Games
by: Anand, Ashwani, et al.
Published: (2023)

Concurrent Permissive Strategy Templates
by: Anand, Ashwani, et al.
Published: (2026)

Computing Adequately Permissive Assumptions for Synthesis
by: Anand, Ashwani, et al.
Published: (2023)

Quantitative Strategy Templates
by: Anand, Ashwani, et al.
Published: (2025)

Most General Winning Secure Equilibria Synthesis in Graph Games
by: Nayak, Satya Prakash, et al.
Published: (2024)

Fair Quantitative Games
by: Anand, Ashwani, et al.
Published: (2025)

Solving Two-Player Games under Progress Assumptions
by: Schmuck, Anne-Kathrin, et al.
Published: (2023)

Doubly Fair Parity Games
by: Hausmann, Daniel, et al.
Published: (2023)

Context-triggered Abstraction-based Control Design
by: Nayak, Satya Prakash, et al.
Published: (2023)

Incremental Data-Driven Policy Synthesis via Game Abstractions
by: Sağlam, Irmak, et al.
Published: (2025)

Permissive Equilibria in Multiplayer Reachability Games
by: Goeminne, Aline, et al.
Published: (2024)

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
by: Nayak, Satya Prakash, et al.
Published: (2022)

Multi-weighted Reachability Games and Their Application to Permissiveness
by: Brihaye, Thomas, et al.
Published: (2023)

Follow the STARs: Dynamic $ω$-Regular Shielding of Learned Policies
by: Anand, Ashwani, et al.
Published: (2025)

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
by: Doyen, Laurent, et al.
Published: (2026)

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

Pursuit Winning Strategies for Reach-Avoid Games with Polygonal Obstacles
by: Yan, Rui, et al.
Published: (2024)

A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games
by: Berthon, Raphaël, et al.
Published: (2025)

Properties of Winning Iterated Prisoner's Dilemma Strategies
by: Glynatsi, Nikoleta E., et al.
Published: (2020)

Benchmarks for Parity Games (extended version)
by: Keiren, Jeroen J. A.
Published: (2014)

Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms
by: Asadi, Ali, et al.
Published: (2024)

Can a Weaker Player Win? Adaptive Play in Repeated Games
by: ANSELMI, Jonatha, et al.
Published: (2026)

Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round
by: Blum, Avrim, et al.
Published: (2024)

Convex-Concave Zero-sum Markov Stackelberg Games
by: Goktas, Denizalp, et al.
Published: (2024)

The Complexity of Sparse Win-Lose Bimatrix Games
by: Batziou, Eleni, et al.
Published: (2026)

In This Apportionment Lottery, the House Always Wins
by: Gölz, Paul, et al.
Published: (2022)

Mixed Strategy Constraints in Continuous Games
by: Krusniak, Mel, et al.
Published: (2024)

Commitment to Sparse Strategies in Two-Player Games
by: Afiouni, Salam, et al.
Published: (2024)

Bounded-Memory Strategies in Partial-Information Games
by: Bose, Sougata, et al.
Published: (2024)

Efficient Stackelberg Strategies for Finitely Repeated Games
by: Collina, Natalie, et al.
Published: (2022)

Localized Attractor Computations for Infinite-State Games (Full Version)
by: Schmuck, Anne-Kathrin, et al.
Published: (2024)

A Resource Allocation Game and its Equilibrium Strategies
by: Lee, Duan-Shin
Published: (2026)

Exploring Equilibrium Strategies in Network Games with Generative AI
by: Yang, Yaoqi, et al.
Published: (2024)

Synthesis of Robust Optimal Strategies in Weighted Timed Games
by: Monmege, Benjamin, et al.
Published: (2024)

Solving Infinite-Player Games with Player-to-Strategy Networks
by: Martin, Carlos, et al.
Published: (2025)

Beyond Winning Strategies: Admissible and Admissible Winning Strategies for Quantitative Reachability Games
by: Muvvala, Karan, et al.
Published: (2024)

The Impacts of Increasingly Complex Matchup Models on Baseball Win Probability
by: Mott, Tristan, et al.
Published: (2025)

Concurrent Strategies on Games with Algebras
by: Huriot-Tattegrain, Sacha, et al.
Published: (2024)

Permissible four-strategy quantum extensions of classical games
by: Frąckiewicz, Piotr, et al.
Published: (2024)

Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
by: Berthon, Raphaël, et al.
Published: (2024)