Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dynamic Relaxations for Online Bipartite Matching   Online bipartite matching (OBM) is a fundamental model underpinning many
important applications, including search engine advertisement, website banner
and pop-up ads, and ride-hailing. We study the i.i.d. OBM problem, where one
side of the bipartition is fixed and known in advance, while nodes from the
other side appear sequentially as i.i.d. realizations of an underlying
distribution, and must immediately be matched or discarded. We introduce
dynamic relaxations of the set of achievable matching probabilities, show how
they theoretically dominate lower-dimensional, static relaxations from previous
work, and perform a polyhedral study to theoretically examine the new
relaxations' strength. We also discuss how to derive heuristic policies from
the relaxations' dual prices, in a similar fashion to dynamic resource prices
used in network revenue management. We finally present a computational study to
demonstrate the empirical quality of the new relaxations and policies.

27
The categories of this paper are: comp-gas
13
The categories of this paper are: quant-ph
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
19
The categories of this paper are: eess
21
The categories of this paper are: adap-org
35
The categories of this paper are: mtrl-th
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph
9
The categories of this paper are: nlin
32
The categories of this paper are: atom-ph
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
23
The categories of this paper are: solv-int