Liming Ge

2 accepted papers

2025

Online Generalized Magician’s Problem with Multiple Workers

UAI 2025

We study the online Generalized Magician’s Problem with Multiple Workers (GMPMW), where tasks arrive sequentially and must be assigned to one of several workers for processing, with each worker consuming a stochastic amount of resources and generating an unknown reward. The system must decide on the

Cited by 0 Source ↗PDF ↗Scholar ↗

2023

Online Task Assignment with Controllable Processing Time

Ruoyu Wu, Wei Bao, Liming Ge

IJCAI 2023poster

We study a new online assignment problem, called the Online Task Assignment with Controllable Processing Time. In a bipartite graph, a set of online vertices (tasks) should be assigned to a set of offline vertices (machines) under the known adversarial distribution (KAD) assumption. We are the firs…

Cited by 3 Source ↗PDF ↗Scholar ↗