arXiv (All)
open access
Dynamic Strategy Selection
We consider the problem of dynamically selecting among competing strategies using observable predictors. To mitigate estimation noise and excessive switching, we regularise the estimated policy with a switching cost, which may exceed actual transaction costs when these are too small to provide suffi
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
- Sequential Estimation of Dynamic Discrete Choice Models with Unobserved Heterogeneity#1011087
- Dynamic Policy Evaluation and Learning with Spatio-temporal Data#1109689
- Alpha-R1: Alpha Screening with LLM Reasoning via Reinforcement Learning#984106
- Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Models#652164
- Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Models#650711
Record · ID 1491387
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