arXiv (All)
open access
Online Resource Allocation with Cancellations
We initiate the study of two-sided online resource allocation with costly cancellations within the buyback model. Our focus is on edge-weighted online matching and several of its extensions. In our base matching model, nodes arrive online on one side and request offline resources on the other side.
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
- The threshold for online balancing of i.i.d. binary vectors#1084877
- A Tight $\widetilde Ω(\sqrt{m})$ Information-Theoretic Lower Bound for Randomized Online Set Cover#1000149
- From the Social Choice Problem to a Collusion-Proof Tendering Mechanism for Dynamic Stochastic Projects#792968
- From the Social Choice Problem to a Collusion-Proof Tendering Mechanism for Dynamic Stochastic Projects#788964
- Valuation in Over-the-Counter Markets#942717
Record · ID 1342268
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