A nonasymptotic analysis for re-solving heuristic in online matching

We investigate an online edge-weighted bipartite matching problem with general capacity constraints. In this problem, the resources are offline and nonreplenishable with different capacities. Demands arrive online and each requests a certain amount of resources. The goal is to maximize the reward ge...

Full description

Saved in:
Bibliographic Details
Main Authors: Wang, Hao, Yan, Zhenzhen, Bei, Xiaohui
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/10356/162741
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English