Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Dynamic Observation Strategy for Multi-agent Multi-armed Bandit
  Problem   We define and analyze a multi-agent multi-armed bandit problem in which
decision-making agents can observe the choices and rewards of their neighbors
under a linear observation cost. Neighbors are defined by a network graph that
encodes the inherent observation constraints of the system. We define a cost
associated with observations such that at every instance an agent makes an
observation it receives a constant observation regret. We design a sampling
algorithm and an observation protocol for each agent to maximize its own
expected cumulative reward through minimizing expected cumulative sampling
regret and expected cumulative observation regret. For our proposed protocol,
we prove that total cumulative regret is logarithmically bounded. We verify the
accuracy of analytical bounds using numerical simulations.

19
The categories of this paper are: eess
27
The categories of this paper are: comp-gas
6
The categories of this paper are: astro-ph
37
The categories of this paper are: supr-con
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
34
The categories of this paper are: chem-ph
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga
18
The categories of this paper are: econ
35
The categories of this paper are: mtrl-th
16
The categories of this paper are: stat
33
The categories of this paper are: plasm-ph
10
The categories of this paper are: q-bio