Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
From MaRDI portal
Publication:5145000
DOI10.1145/3357713.3384294OpenAlexW3035275081MaRDI QIDQ5145000FDOQ5145000
Authors: Qiankun Zhang, Zhiyi Huang
Publication date: 19 January 2021
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01802
Recommendations
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
- Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation
- Online stochastic matching: new algorithms and bounds
- Randomized primal-dual analysis of RANKING for online bipartite matching
- Online stochastic matching with unequal probabilities
Cited In (5)
- Adwords in a panorama
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
- Online matching with stochastic rewards: advanced analyses using configuration linear programs
- Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation
- Title not available (Why is that?)
This page was built for publication: Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145000)