Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Max-Min Grouped Bandits   In this paper, we introduce a multi-armed bandit problem termed max-min
grouped bandits, in which the arms are arranged in possibly-overlapping groups,
and the goal is to find the group whose worst arm has the highest mean reward.
This problem is of interest in applications such as recommendation systems and
resource allocation, and is also closely related to widely-studied robust
optimization problems. We present two algorithms based successive elimination
and robust optimization, and derive upper bounds on the number of samples to
guarantee finding a max-min optimal or near-optimal group, as well as an
algorithm-independent lower bound. We discuss the degree of tightness of our
bounds in various cases of interest, and the difficulties in deriving uniformly
tight bounds.

21
The categories of this paper are: adap-org
34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
5
The categories of this paper are: gr-qc
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
20
The categories of this paper are: acc-phys
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin