Multi-armed bandit - Wikipedia
In probability theory, the multi-armed bandit problem (sometimes called the ) is a problem in which a fixed limited set of resources must be allocated between competing (alternative) choices in a way that maximizes their expected gain, when each choice's
https://en.wikipedia.org/wiki/Multi-armed_bandit