Noise Free Multi-armed Bandit Game

Lecture Notes in Computer Science, pp. 412-423, 2016.

Cited by: 2|Views9
EI

Abstract:

We study the loss version of adversarial multi-armed bandit problems with one lossless arm. We show an adversary's strategy that forces any player to suffer K - 1 - O(1/T) loss where K is the number of arms and T is the number of rounds.

Code:

Data:

Get fulltext within 24h
Bibtex
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

Upload a single paper

for 5 coins

Wechat's Red Packet
?

Upload 50 articles

for 250 coins

Wechat's Red Packet
?

Upload 200 articles

for 1000 coins

Wechat's Red Packet
?

Upload 500 articles

for 2500 coins

Wechat's Red Packet
?

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :
0

 

Tags
Comments