Search papers, labs, and topics across Lattice.
Affiliation:
1
0
3
A simple greedy approach offers a $\frac{1}{\sqrt{e}}$-approximation for optimal policies in heterogeneous asynchronous multi-player bandits, a problem previously intractable.