Motivated by centralized matching markets, we study an online stochastic matching problem
on edge-weighted graphs, where the agents' arrivals and abandonments are stochastic and …

We study the polynomial-time approximability of the optimal online stochastic bipartite
matching algorithm, initiated by Papadimitriou et al.(EC'21). Here, nodes on one side of the …

Motivated by the exploding growth of web-based services and the importance of efficiently
managing the computational resources of such systems, we introduce and study a …

We study dynamic matching in a spatial setting. Drivers are distributed at random on some
interval. Riders arrive in some (possibly adversarial) order at randomly drawn points. The …

Multiaccess edge computing (MEC) and network virtualization technologies are important
enablers for fifth generation networks to deliver diverse services. Services are often provided …

In online minimum cost matching on the line, n requests appear one by one and have to be
matched immediately and irrevocably to a given set of servers, all on the real line. The goal …

In the classical Online Metric Matching problem, we are given a metric space with $ k $
servers. A collection of clients arrive in an online fashion, and upon arrival, a client should …

In the online minimum cost matching problem, there are n servers and, at each of n time
steps, a request arrives and must be irrevocably matched to a server that has not yet been …

We investigate online maximum cardinality matching, a central problem in ad allocation. In
this problem, users are revealed sequentially, and each new user can be paired with any …

For the online transportation problem with $ m $ server sites, it has long been known that the
competitive ratio of any deterministic algorithm is at least $2 m-1$. Kalyanasundaram and …