ISTA Publications
metadata only
Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms
We study two-player zero-sum concurrent stochastic games with finite state and action space played for an infinite number of steps. In every step, the two players simultaneously and independently choose an action. Given the current state and the chosen actions, the next state is obtained according t
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
- Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games#1083967
- Two-Person Additively-Separable Sum Games#1441881
- Cycle structure of best-response dynamics in random bimatrix games#1413394
- On Periodic and Aperiodic Optimal Strategies in Solvency Games#1014032
- On the Generic Finiteness of Equilibrium Outcome Distributions in Bimatrix Game Forms#1275427
Record · ID 1492922
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