Online matching: A brief survey
Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of
collaborators, is a central problem in economics. Indeed, the growing prevalence of …
collaborators, is a central problem in economics. Indeed, the growing prevalence of …
Online matching and ad allocation
A Mehta - … and Trends® in Theoretical Computer Science, 2013 - nowpublishers.com
Matching is a classic problem with a rich history and a significant impact, both on the theory
of algorithms and in practice. Recently there has been a surge of interest in the online …
of algorithms and in practice. Recently there has been a surge of interest in the online …
Online assortment optimization for two-sided matching platforms
Motivated by online labor markets, we consider the online assortment optimization problem
faced by a two-sided matching platform that hosts a set of suppliers waiting to match with a …
faced by a two-sided matching platform that hosts a set of suppliers waiting to match with a …
Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios
Motivated by the dynamic assortment offerings and item pricings occurring in e-commerce,
we study a general problem of allocating finite inventories to heterogeneous customers …
we study a general problem of allocating finite inventories to heterogeneous customers …
Online stochastic matching, poisson arrivals, and the natural linear program
We study the online stochastic matching problem. Consider a bipartite graph with offline
vertices on one side, and with iid online vertices on the other side. The offline vertices and …
vertices on one side, and with iid online vertices on the other side. The offline vertices and …
Adwords in a panorama
Three decades ago, Karp, Vazirani, and Vazirani (STOC 1990) defined the online matching
problem and gave an optimal (1-1/e)-competitive (about 0.632) algorithm. Fifteen years later …
problem and gave an optimal (1-1/e)-competitive (about 0.632) algorithm. Fifteen years later …
A multi-armed bandit approach to online spatial task assignment
Spatial crowd sourcing uses workers for performing tasks that require travel to different
locations in the physical world. This paper considers the online spatial task assignment …
locations in the physical world. This paper considers the online spatial task assignment …
Asymptotically optimal competitive ratio for online allocation of reusable resources
We consider the problem of online allocation (matching, budgeted allocations, and
assortments) of reusable resources for which an adversarial sequence of resource requests …
assortments) of reusable resources for which an adversarial sequence of resource requests …
Online matching with stochastic rewards: Advanced analyses using configuration linear programs
Z Huang, H Jiang, A Shen, J Song, Z Wu… - … Conference on Web and …, 2023 - Springer
Abstract Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards,
which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and Vazirani …
which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and Vazirani …
New algorithms, better bounds, and a novel model for online stochastic matching
Online matching has received significant attention over the last 15 years due to its close
connection to Internet advertising. As the seminal work of Karp, Vazirani, and Vazirani has …
connection to Internet advertising. As the seminal work of Karp, Vazirani, and Vazirani has …