Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Satisficing in multi-armed bandit problems   Satisficing is a relaxation of maximizing and allows for less risky decision
making in the face of uncertainty. We propose two sets of satisficing
objectives for the multi-armed bandit problem, where the objective is to
achieve reward-based decision-making performance above a given threshold. We
show that these new problems are equivalent to various standard multi-armed
bandit problems with maximizing objectives and use the equivalence to find
bounds on performance. The different objectives can result in qualitatively
different behavior; for example, agents explore their options continually in
one case and only a finite number of times in another. For the case of Gaussian
rewards we show an additional equivalence between the two sets of satisficing
objectives that allows algorithms developed for one set to be applied to the
other. We then develop variants of the Upper Credible Limit (UCL) algorithm
that solve the problems with satisficing objectives and show that these
modified UCL algorithms achieve efficient satisficing performance.

12
The categories of this paper are: nucl-th
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
3
The categories of this paper are: physics
11
The categories of this paper are: hep-lat
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
10
The categories of this paper are: q-bio
17
The categories of this paper are: q-fin
4
The categories of this paper are: cond-mat
21
The categories of this paper are: adap-org
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
14
The categories of this paper are: math-ph