No article text was recorded for this version.
reusable resource allocation
Version 1 of 141 papers59 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Online Bipartite Matching with Reusable Resources
- Blog: Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources
- Blog: Periodic Reranking for Online Matching of Reusable Resources
- Blog: Online Stochastic Allocation of Reusable Resources
- Blog: Technical Note—Near-Optimal Bayesian Online Assortment of Reusable Resources
- Blog: Sequential Blocked Matching
- Blog: Fully Dynamic Online Selection through Online Contention Resolution Schemes
- Blog: Competitive Ratios for Online Multi-capacity Ridesharing
- Blog: Online Task Assignment Problems with Reusable Resources
- Blog: Resource Sharing through Multi-Round Matchings
- Blog: No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
- Blog: Admission Control to Minimize Rejections and Online Set Cover with Repetitions
- Blog: Non-Stationary Online Resource Allocation: Learning from a Single Sample
- Blog: Adversarial Blocking Bandits
- Blog: Online Learning with Knapsacks: the Best of Both Worlds
- Blog: A process algebraic approach to the specification and analysis of resource-bound real-time systems
- Blog: Near-Optimal Bayesian Online Assortment of Reusable Resources
- Blog: Efficient Nonmyopic Online Allocation of Scarce Reusable Resources
- Blog: Survey of Dynamic Resource Constrained Reward Collection Problems: Unified Model and Analysis
- Blog: Online Job Assignment
- Blog: Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching
- Blog: Competitive Online Optimization under Inventory Constraints
- Blog: Online Learning and Pricing with Reusable Resources: Linear Bandits with Sub-Exponential Rewards
- Blog: Online Allocation with Replenishable Budgets: Worst Case and Beyond
- Blog: Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
- Blog: Secure IP Address Allocation at Cloud Scale
- Blog: Contextual Procurement in Online Crowdsourcing Markets
- Blog: Online Learning and Pricing for Network Revenue Management with Reusable Resources
- Blog: A Unified Model for the Two-stage Offline-then-Online Resource Allocation
- Blog: Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours
- Blog: Online Learning with Knapsacks: the Best of Both Worlds
- Blog: Locally Rainbow Paths
- Blog: The Temp Secretary Problem
- Blog: Robust Cuts Over Time: Combatting the Spread of Invasive Species with Unreliable Biological Control
- Blog: Dynamic Pricing for Reusable Resources in Competitive Market With Stochastic Demand
- Blog: Online Learning and Pricing with Reusable Resources: Linear Bandits with Sub-Exponential Rewards
- Blog: Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
- Blog: Online Bipartite Matching with Reusable Resources
- Blog: Single-Sample and Robust Online Resource Allocation
- Blog: A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
- Blog: Probabilistic Resource Route Queries with Reappearance
History & citation
Current · Permanent link
- This direction split from Online Allocation of Reusable Resources (83% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_reusable_resource_allocation_d580a4ef,
title = {reusable resource allocation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/reusable-resource-allocation/rdr_d580a4ef979740279c09078d24594c5a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_reusable_resource_allocation_d580a4ef_v1,
title = {reusable resource allocation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/reusable-resource-allocation/rdr_d580a4ef979740279c09078d24594c5a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}