Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Approximate optimality with bounded regret in dynamic matching models   We consider a discrete-time bipartite matching model with random arrivals of
units of supply and demand that can wait in queues located at the nodes in the
network. A control policy determines which are matched at each time. The focus
is on the infinite-horizon average-cost optimal control problem. A relaxation
of the stochastic control problem is proposed, which is found to be a special
case of an inventory model, as treated in the classical theory of Clark and
Scarf. The optimal policy for the relaxation admits a closed-form expression.
Based on the policy for this relaxation, a new matching policy is proposed. For
a parameterized family of models in which the network load approaches capacity,
this policy is shown to be approximately optimal, with bounded regret, even
though the average cost grows without bound.

12
The categories of this paper are: nucl-th
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
19
The categories of this paper are: eess
10
The categories of this paper are: q-bio