ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2306.00172
  4. Cited By
Learning for Edge-Weighted Online Bipartite Matching with Robustness
  Guarantees

Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

31 May 2023
Pengfei Li
Jianyi Yang
Shaolei Ren
    OffRL
ArXivPDFHTML

Papers citing "Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees"

5 / 5 papers shown
Title
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go
  Approximation
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
Alexandre Hayderi
Amin Saberi
Ellen Vitercik
Anders Wikum
36
0
0
10 Jun 2024
Online bipartite matching with imperfect advice
Online bipartite matching with imperfect advice
Davin Choo
Themis Gouleakis
Chun Kai Ling
Arnab Bhattacharyya
52
1
0
16 May 2024
Learning-Augmented Decentralized Online Convex Optimization in Networks
Learning-Augmented Decentralized Online Convex Optimization in Networks
Pengfei Li
Jianyi Yang
Adam Wierman
Shaolei Ren
OffRL
18
1
0
16 Jun 2023
A Regression Approach to Learning-Augmented Online Algorithms
A Regression Approach to Learning-Augmented Online Algorithms
Keerti Anand
Rong Ge
Amit Kumar
Debmalya Panigrahi
26
20
0
18 May 2022
Deep Policies for Online Bipartite Matching: A Reinforcement Learning
  Approach
Deep Policies for Online Bipartite Matching: A Reinforcement Learning Approach
Mohammad Ali Alomrani
Reza Moravej
Elias Boutros Khalil
OffRL
39
22
0
21 Sep 2021
1