arXiv (All)
open access
A First-Order Learning Algorithm for Online Resource Allocation with Constant Regret
We study a finite-horizon online resource allocation problem with initial resource capacities proportional to the horizon. In each period, a request type is observed and one action is chosen from a finite menu. Each action earns a reward and consumes a vector of resources. The arrival types are inde
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
- Safe, Always-Valid Alpha-Investing Rules For Doubly Sequential Online Inference#820302
- Amortized Inference for Correlated Discrete Choice Models via Equivariant Neural Networks#985033
- Almost Sure Convergence of Networked Policy Gradient over Time-Varying Networks in Markov Potential Games#1035271
- Online Resource Allocation with Replenishable Budgets#1129974
- Entropic Risk-Sensitive Evolutionary Learning and Equilibrium Selection in Coordination Games#986008
Record · ID 973515
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