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...
| Principais autores: | , , |
|---|---|
| Outros Autores: | |
| Formato: | Journal Article |
| Idioma: | English |
| Publicado em: |
2022
|
| Assuntos: | |
| Acesso em linha: | https://hdl.handle.net/10356/162741 |