arXiv (All)
open access
Smoothed analysis of policy iteration and value iteration for deterministic discounted and mean-payoff games played on any graph
Our understanding of turn-based stochastic games is reminiscent of our understanding of linear programming in the 1970s. Instead of the simplex method, we have two families of algorithms - policy iteration and value iteration - which work well in practice but are known to run in exponential time on
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
- Pricing of graph-based quantum portfolios from first principles#1187957
- An Automata-Based Approach to Games with $ω$-Automatic Preferences#1123020
- "Recursive Preferences,"#942183
- Row-Polar LP-Newton for Linear Programming with Corral Repair#1083258
- Advancing Learning and Evolutionary Game Theory with an Application to Social Dilemmas#1278165
Record · ID 1357804
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