Deep Policies for Online Bipartite Matching: A Reinforcement Learning Approach

21 September 2021

Papers citing "Deep Policies for Online Bipartite Matching: A Reinforcement Learning Approach"

10 / 10 papers shown

Title
Online Budgeted Matching with General Bids Jianyi Yang Pengfei Li Adam Wierman Shaolei Ren 24 0 0 06 Nov 2024
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation Alexandre Hayderi Amin Saberi Ellen Vitercik Anders Wikum 23 0 0 10 Jun 2024
Online bipartite matching with imperfect advice Davin Choo Themis Gouleakis Chun Kai Ling Arnab Bhattacharyya 52 1 0 16 May 2024
Learning Efficient and Fair Policies for Uncertainty-Aware Collaborative Human-Robot Order Picking Igor G. Smit Z. Bukhsh Mykola Pechenizkiy Kostas Alogariastos Kasper Hendriks Yingqian Zhang 31 0 0 09 Apr 2024
Robust Learning for Smoothed Online Convex Optimization with Feedback Delay Pengfei Li Jianyi Yang Adam Wierman Shaolei Ren 23 2 0 31 Oct 2023
Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees Pengfei Li Jianyi Yang Shaolei Ren OffRL 19 4 0 31 May 2023
Robustified Learning for Online Optimization with Memory Costs Pengfei Li Jianyi Yang Shaolei Ren OffRL 16 5 0 01 May 2023
Learning-Assisted Algorithm Unrolling for Online Optimization with Budget Constraints Jianyi Yang Shaolei Ren 18 2 0 03 Dec 2022
Understanding Curriculum Learning in Policy Optimization for Online Combinatorial Optimization Runlong Zhou Zelin He Yuandong Tian Yi Wu S. Du OffRL 18 3 0 11 Feb 2022
Deep Learning for Two-Sided Matching S. Ravindranath Zhe Feng Shira Li Jonathan Ma S. Kominers David C. Parkes 18 22 0 07 Jul 2021