arXiv (All)
open access
Orchestrating Level-$K$ Policies Against Unknown Opponents in Partially-Observable Dynamic Games
Level-$K$ reasoning generates a hierarchy of policies specialized to opponents with different reasoning levels. When an opponent's level is unknown, a common deployment rule estimates that level and selects the corresponding response. In a dynamic, partially-observed game, this selection is repeated
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
- Formulating Decision Theory as Program Search#108176
- Evolving Support Priorities in Empathetic Reinforcement Learning#1119322
- Interpolating Decisions#711447
- PL-Guard: Probabilistic Logic Reasoning for LLM Guardrails#616819
- PL-Guard: Probabilistic Logic Reasoning for LLM Guardrails#616319
Record · ID 1200588
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