![]() ![]() There are many important real-life problems, such as drug clinical trials, that are similar to the slot machine example. The problem is not as whimsical as it might first seem. This is an example of what’s called the multi-armed bandit problem, so named because a slot machine is informally called a one-armed bandit. What strategies can you use to try and maximize your gain? The machines pay out differently, but you initially have no knowledge of what kind of payout schedules the machines follow. You have 20 tokens to use, where you drop a token into any of the three machines, pull the handle and are paid a random amount. Imagine you’re in Las Vegas, standing in front of three slot machines. Volume 31 Number 5 The Multi-Armed Bandit Problemīy James McCaffrey | May 2016 | Get the Code: C# VB
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |