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...
Saved in:
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 |
Similar Items
-
Adaptive dynamic bipartite graph matching : a reinforcement learning approach
by: Wang, Yansheng, et al.
Published: (2021) -
Arbitrated Matching: Formulation and Protocol
by: NG, W. Y., et al.
Published: (1996) -
View-based 3D object retrieval by bipartite graph matching
by: Wen, Y., et al.
Published: (2013) -
3D model retrieval using weighted bipartite graph matching
by: Gao, Y., et al.
Published: (2013) -
View-based 3D Object Retrieval by Bipartite Graph Matching
by: WEN, Yue, et al.
Published: (2012)