2 papers
math.OC2026
Online Bipartite Matching with Reusable Capacity under Non-Stationary Rewards
Xi Chen, Shixin Wang, Bingkun Zhou +1
We study online bipartite matching with reusable server capacity and non-stationary rewards. Jobs arrive sequentially, reveal compatible servers, reward rates, and processing durat…
cs.DS2023
Leveraging Reusability: Improved Competitive Ratio of Greedy for Reusable Resources
Jackie Baek, Shixin Wang
We study online weighted bipartite matching of reusable resources where an adversarial sequence of requests for resources arrive over time. A resource that is matched is 'used' for…