4 ms·
A problem similar to the one you're describing (having a number of options and limited number of attempts to maximize gains) is known as the "Multi-armed bandit
by visarga 9y ago
A problem similar to the one you're describing (having a number of options and limited number of attempts to maximize gains) is known as the "Multi-armed bandit" and has been studied in A/B testing, optimization and reinforcement learning.
https://en.wikipedia.org/wiki/Multi-armed_bandit https://en.wikipedia.org/wiki/Multi-armed_bandit
> In probability theory , the multi armed bandit problem (sometimes called the K - or N armed bandit problem) is a problem in which a gambler at a row of slot machines (sometimes known as "one armed bandits") has to decide which machines to play, how many times to play each machine and in which order to play them. When played, each machine provides a random reward from a probability distribution specific to that machine. The objective of the gambler is to maximize the sum of rewards earned through a sequence of lever pulls.
In essence it is a problem of balancing exploration and exploitation (the so called exploration/exploitation tradeoff), which is at the heart of how agents learn.