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 …

We consider the problem of online allocation (matching, budgeted allocations, and
assortments) of reusable resources for which an adversarial sequence of resource requests …

Network revenue management (NRM) describes a general online allocation problem in
which combinations of capacity-constrained resources are sold to a stream of arriving …

In the classic Adwords problem introduced by [Mehta A, Saberi A, Vazirani U, Vazirani V
(2007) Adwords and generalized online matching. J. ACM 54 (5): 22-es.], we have a …

Motivated by real-world applications such as rental and cloud computing services, we
investigate pricing for reusable resources. We consider a system where a single resource …

We study a general class of sequential search problems for selecting multiple candidates
from different societal groups under" ex-ante constraints" aimed at producing socially …

The online weighted matching problem is a fundamental problem in machine learning due
to its numerous applications. Despite many efforts in this area, existing algorithms are either …

We study online weighted bipartite matching of reusable resources where an adversarial
sequence of requests for resources arrive over time. A resource that is matched is' used'for a …

Motivated by applications in cloud computing spot markets and selling banner ads on
popular websites, we study the online resource allocation problem with overbooking and …

For numerous online bipartite matching problems, such as edge-weighted matching and
matching under two-sided vertex arrivals, the state-of-the-art fractional algorithms outperform …