Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Logarithmic regret bounds for Bandits with Knapsacks   Optimal regret bounds for Multi-Armed Bandit problems are now well
documented. They can be classified into two categories based on the growth rate
with respect to the time horizon $T$: (i) small, distribution-dependent, bounds
of order of magnitude $\ln(T)$ and (ii) robust, distribution-free, bounds of
order of magnitude $\sqrt{T}$. The Bandits with Knapsacks model, an extension
to the framework allowing to model resource consumption, lacks this clear-cut
distinction. While several algorithms have been shown to achieve asymptotically
optimal distribution-free bounds on regret, there has been little progress
toward the development of small distribution-dependent regret bounds. We
partially bridge the gap by designing a general-purpose algorithm with
distribution-dependent regret bounds that are logarithmic in the initial
endowments of resources in several important cases that cover many practical
applications, including dynamic pricing with limited supply, bid optimization
in online advertisement auctions, and dynamic procurement.

5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
19
The categories of this paper are: eess
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
25
The categories of this paper are: patt-sol
37
The categories of this paper are: supr-con