Learning for edge-weighted online bipartite matching with robustness guarantees

P Li, J Yang, S Ren - International Conference on Machine …, 2023 - proceedings.mlr.press
Many problems, such as online ad display, can be formulated as online bipartite matching.
The crucial challenge lies in the nature of sequentially-revealed online item information …
被引用次数：7 相关文章
[PDF] mlr.press

[PDF][PDF] Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

P Li, J Yang, S Ren - proceedings.mlr.press
Many problems, such as online ad display, can be formulated as online bipartite matching.
The crucial challenge lies in the nature of sequentiallyrevealed online item information …

Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

P Li, J Yang - International Conference on Machine Learning, 2023 - par.nsf.gov
Many problems, such as online ad display, can be formulated as online bipartite matching.
The crucial challenge lies in the nature of sequentially-revealed online item information …

Learning for edge-weighted online bipartite matching with robustness guarantees

P Li, J Yang, S Ren - Proceedings of the 40th International Conference …, 2023 - dl.acm.org
Many problems, such as online ad display, can be formulated as online bipartite matching.
The crucial challenge lies in the nature of sequentially-revealed online item information …

Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

P Li, J Yang, S Ren - arXiv preprint arXiv:2306.00172, 2023 - arxiv.org
Many problems, such as online ad display, can be formulated as online bipartite matching.
The crucial challenge lies in the nature of sequentially-revealed online item information …

Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

P Li, J Yang, S Ren - arXiv e-prints, 2023 - ui.adsabs.harvard.edu
Many problems, such as online ad display, can be formulated as online bipartite matching.
The crucial challenge lies in the nature of sequentially-revealed online item information …

Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

P Li, J Yang, S Ren - openreview.net
Many problems, such as online ad display, can be formulated as online bipartite matching.
The crucial challenge lies in the nature of sequentially-revealed online item information …

Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

P Li, J Yang, S Ren - openreview.net
Many real-world problems, such as online ad display, can be formulated as online bipartite
matching. The crucial challenge lies in the nature of sequentially-revealed online item …

[引用][C] Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

P LI, J YANG, S REN