Copertina

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Bhaduri, Purandar
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computer Science and Game Theory Computational Complexity Formal Languages and Automata Theory Logic in Computer Science Multiagent Systems
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

STL-GO: Spatio-Temporal Logic with Graph Operators for Distributed Systems with Multiple Network Topologies
di: Zhao, Yiqi, et al.
Pubblicazione: (2025)

Monitoring Spatially Distributed Cyber-Physical Systems with Alternating Finite Automata
di: Balakrishnan, Anand, et al.
Pubblicazione: (2025)

Module checking of pushdown multi-agent systems
di: Bozzelli, Laura, et al.
Pubblicazione: (2020)

The SCAN Statistical Model Checker
di: Ghiorzi, Enrico, et al.
Pubblicazione: (2026)

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

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

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
di: Achilleos, Antonis, et al.
Pubblicazione: (2024)

The Complexity of Nested Reset Counter Systems
di: Balasubramanian, A. R., et al.
Pubblicazione: (2026)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
di: Göller, Stefan, et al.
Pubblicazione: (2023)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
di: Shakiba, Yousef, et al.
Pubblicazione: (2025)

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

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

Non-commutative linear logic fragments with sub-context-free complexity
di: Nishimiya, Yusaku, et al.
Pubblicazione: (2025)

Nets-within-Nets through the Lens of Data Nets
di: Di Cosmo, Francesco, et al.
Pubblicazione: (2025)

On Higher Order Busy Beaver Function
di: Cao, Zining
Pubblicazione: (2025)

Reachability in Geometrically $d$-Dimensional VASS
di: Fu, Yuxi, et al.
Pubblicazione: (2025)

Stochastic Process Turing Machines
di: Wolpert, David, et al.
Pubblicazione: (2024)

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

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

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

Counting and Sampling Traces in Regular Languages
di: de Colnet, Alexis, et al.
Pubblicazione: (2025)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
di: Halftermeyer, Pierre
Pubblicazione: (2026)

Higher-Dimensional Timed Automata for Real-Time Concurrency
di: Amrane, Amazigh, et al.
Pubblicazione: (2024)

Faster and Smaller Solutions of Obliging Games
di: Hausmann, Daniel, et al.
Pubblicazione: (2024)

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

An Automata-Based Approach to Games with $ω$-Automatic Preferences
di: Bruyère, Véronique, et al.
Pubblicazione: (2026)

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

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
di: Li, Shuo, et al.
Pubblicazione: (2023)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
di: Di Giusto, Cinzia, et al.
Pubblicazione: (2025)

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
di: Caltais, Georgiana, et al.
Pubblicazione: (2024)

Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints
di: Gutierrez, Julian, et al.
Pubblicazione: (2023)