A Confirmation of a Conjecture on the Feldman's Two-armed Bandit Problem

06/02/2022
by   Zengjing Chen, et al.
0

Myopic strategy is one of the most important strategies when studying bandit problems. In this paper, we consider the two-armed bandit problem proposed by Feldman. With general distributions and utility functions, we obtain a necessary and sufficient condition for the optimality of the myopic strategy. As an application, we could solve Nouiehed and Ross's conjecture for Bernoulli two-armed bandit problems that myopic strategy stochastically maximizes the number of wins.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2019

Exponential two-armed bandit problem

We consider exponential two-armed bandit problem in which incomes are de...
research
07/27/2017

Max K-armed bandit: On the ExtremeHunter algorithm and beyond

This paper is devoted to the study of the max K-armed bandit problem, wh...
research
07/03/2020

Hedging using reinforcement learning: Contextual k-Armed Bandit versus Q-learning

The construction of replication strategies for contingent claims in the ...
research
12/14/2018

Guaranteed satisficing and finite regret: Analysis of a cognitive satisficing value function

As reinforcement learning algorithms are being applied to increasingly c...
research
06/20/2019

The Finite-Horizon Two-Armed Bandit Problem with Binary Responses: A Multidisciplinary Survey of the History, State of the Art, and Myths

In this paper we consider the two-armed bandit problem, which often natu...
research
03/07/2023

PyXAB – A Python Library for 𝒳-Armed Bandit and Online Blackbox Optimization Algorithms

We introduce a Python open-source library for 𝒳-armed bandit and online ...
research
08/17/2019

A Batched Multi-Armed Bandit Approach to News Headline Testing

Optimizing news headlines is important for publishers and media sites. A...

Please sign up or login with your details

Forgot password? Click here to reset