Bingqian Du

Online Matching with Stochastic Rewards: Provable Better Bound via Adversarial Reinforcement Learning

For a specific online optimization problem, for example, online bipartite matching (OBM), research efforts could be made in two directions before it is finally closed, i.e., the optimal competitive online algorithm is found. One is to continuously design algorithms with better performance. To this e…