arXiv (OAI Expanded)
open access
Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games
We study 2-player stochastic games on countable graphs. Players Max and Min seek respectively to maximize and minimize the probability of satisfying the game objective. The Büchi objective is to visit a given set of states infinitely often. The Transience objective is to visit no state infinitely of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare#973158
- Path Enumeration by Position-Visit Counts in Recombining Trinomial Trees#1076754
- Antichains for Concurrent Parameterized Games (Long Version)#971689
- Mechanism Design for Facility Location Games Under a Prelocated Facility#799506
- Mechanism Design for Facility Location Games Under a Prelocated Facility#798083
Record · ID 1083967
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive