This paper studies learning-augmented decentralized online convex optimization in a
networked multi-agent system, a challenging setting that has remained under-explored. We …

Achieving optimal order dispatching has been a long-standing challenge for online ride-
hailing platforms. Early methods would make shortsighted matchings as they only consider …

We study the problem of online unweighted bipartite matching with $ n $ offline vertices and
$ n $ online vertices where one wishes to be competitive against the optimal offline …

Online Bayesian bipartite matching is a central problem in digital marketplaces and
exchanges, including advertising, crowdsourcing, ridesharing, and kidney exchange. We …

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, ie, the optimal …

Many mission-critical systems need to solve online decision-making problems such as
workload scheduling in datacenters, power allocation in edge computing, battery …