arXiv (All)
open access
Beyond a Single Optimal Design: A Dynamical Systems Characterization of Online Allocation with Convex Costs
We study online allocation with convex costs (\OACC), a generalization of limited-supply models in which additional resources can be produced dynamically at convex cost. Prior work largely focuses on constructing a single algorithm that achieves strong competitive guarantees. In contrast, our main c
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
- Optimal Transport in Economics#973865
- Quota Mechanisms: Finite-Sample Optimality and Robustness#128265
- Resource Allocation, Control, and Accounting for the Use of Network Resources#136690
- Allocation Multiplicity: Evaluating the Promises of the Rashomon Set#79232
- Empirically Understanding the Value of Prediction in Allocation#215649
Record · ID 1037334
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