Imagen de Portada

Computing Adequately Permissive Assumptions for Synthesis

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Anand, Ashwani, Mallik, Kaushik, Nayak, Satya Prakash, Schmuck, Anne-Kathrin
Formato:	Preprint
Publicado:	2023
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Synthesizing Permissive Winning Strategy Templates for Parity Games
por: Anand, Ashwani, et al.
Publicado: (2023)

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

Concurrent Permissive Strategy Templates
por: Anand, Ashwani, et al.
Publicado: (2026)

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

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

Quantitative Strategy Templates
por: Anand, Ashwani, et al.
Publicado: (2025)

Fair Quantitative Games
por: Anand, Ashwani, et al.
Publicado: (2025)

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

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

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

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

Bidding Games with Charging
por: Avni, Guy, et al.
Publicado: (2024)

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

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

Doubly Fair Parity Games
por: Hausmann, Daniel, et al.
Publicado: (2023)

Auction-Based Scheduling
por: Avni, Guy, et al.
Publicado: (2023)

Bidding Games on Markov Decision Processes with Quantitative Reachability Objectives
por: Avni, Guy, et al.
Publicado: (2024)

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

Synthesis of Universal Safety Controllers
por: Finkbeiner, Bernd, et al.
Publicado: (2025)

Permissible extensions of classical to quantum games combining three strategies
por: Frąckiewicz, Piotr, et al.
Publicado: (2024)

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

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

More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR
por: Gong, Tiantian, et al.
Publicado: (2022)

Platooning as a Service (PlaaS): A Sustainable Transportation Framework for Connected and Autonomous Vehicles
por: Tanaji, Bhosale Akshay, et al.
Publicado: (2026)

Fair and Efficient Completion of Indivisible Goods
por: HV, Vishwa Prakash, et al.
Publicado: (2024)

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
por: Ouhamma, Reda, et al.
Publicado: (2023)

A Gale-Shapley View of Unique Stable Marriages
por: Gokhale, Kartik, et al.
Publicado: (2023)

Fair and Efficient Allocation of Indivisible Mixed Manna
por: Barman, Siddharth, et al.
Publicado: (2025)

Universal Safety Controllers with Learned Prophecies
por: Finkbeiner, Bernd, et al.
Publicado: (2025)

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

Symbolic Computation of Sequential Equilibria
por: Graf, Moritz, et al.
Publicado: (2024)

Computing Equilibrium Nominations in Presidential Elections
por: Faliszewski, Piotr, et al.
Publicado: (2025)

Computational Social Choice: Research & Development
por: Baumeister, Dorothea, et al.
Publicado: (2026)

Resonance: Transaction Fees for Heterogeneous Computation
por: Bahrani, Maryam, et al.
Publicado: (2024)

Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
por: Brihaye, Thomas, et al.
Publicado: (2023)

Hidden-Role Games: Equilibrium Concepts and Computation
por: Carminati, Luca, et al.
Publicado: (2023)

Equilibrium Computation in Multi-Stage Auctions and Contests
por: Pieroth, Fabian R., et al.
Publicado: (2023)

Computing Equilibria in Games with Stochastic Action Sets
por: Schwarz, Thomas, et al.
Publicado: (2026)

Cloud Computing Review: A Decade of Research
por: Swain, Smruti Rekha
Publicado: (2026)

Existence and Computation of Fair Allocations under Constraints
por: Barman, Siddharth, et al.
Publicado: (2026)