4 ms·
If you have no played it, try this game with some friends. It's surprisingly fun. > To simplify the problem, let’s start with the simple scenario where you are
by gus_massa 4y ago
If you have no played it, try this game with some friends. It's surprisingly fun.
> To simplify the problem, let’s start with the simple scenario where you are competing against two other persons.
> P(wining)~=0.296
Where does the other 11.2% go? Is the probability of a triple tie? Perhaps you can add it to the article.
- alexmolas 4y agoI'll play it next time I see them :) Now I'm wondering which is the best strategy you can follow if the other players follow an unknown non-optimal strategy (like selecting 1,2 or 3 with p=1/3). Maybe it's a good scenario to try some reinforcement learning
- gus_massa 4y agoThere is a nice strategy that is playing always 1, and claiming it. Everyone else should not play 1 because otherwise they would not win. But if no one else plays 1, you win. So they must take turns to lose and make you lose. It's a good strategy to not meet them again ever :)
- tromp 4y agoThe other players then always pick 1 and 2, making the latter the winner, and you always the loser. But in this case you lose no matter what strategy you use; you only get to decide which of the other players wins. That's why the article analyses the case where the other players use the same strategy.
- gus_massa 4y agoIt's more fun with more players. They can discuss who is going to lose the round because of choosing 1 to block you. Someone can refuse to collude, so another must take the turn. Someone can decide to become a vigilante and choose always 1 to block you. Humans are very fun!
- planede 4y ago> unknown non-optimal strategy The hard part is to establish a prior for this "unknown". Otherwise you can't say anything.
- tromp 4y agoYes, the only case in which there's no winner is if all 3 pick the same number. Which is why the author skips the case of two players. Because then picking 1 always is a dominating strategy in which neither player wins.
- jetrink 4y agoI wonder what would happen to the two player game if the rewards were set up so that win=1, lose=0, tie=-1? It would be interesting to see how the strategy changed as the penalty for tying is increased.
- ZetaZero 4y agopicking 1 would still dominate over any other strategy, in a head-to-head. However, if you are trying to maximize your H2H score against a pool of contestants, a cooperation strategy, where you both alternated taking the lower number would be close to optimal.
- StevenWaterman 4y agoFor a short intuitive proof of that 1st sentence, imagine both players pick 1 every time. You both lose 1 point. If you're tied for score, you're still tied after the round. Now imagine you change your number to stop ties. Well now you've picked a number bigger than 1, and you lose every time. If you were tied, now you're losing.
- HWR_14 4y agoThis is only true if your goal is to have a score higher than your opponent. It's not true if your goal is to have the highest possible score. If ties are with 0, you always choose 1 in either situation. If ties are worth -1, choosing 1 always achieves a greater than or equal to score but the number will be much lower than if you some percentage of the time choose another number.
- 4y ago
- civilized 4y agoWait, how did you get to 11.2% missing? I think a triple tie means no one wins, which would explain why the probability of winning is less than 1/3. (If each of the three players is playing the same Nash equilibrium strategy, they should each win with the same frequency.)
- mughinn 4y ago0.296 is the chance of one player winning, there are 3 players. 0.296*3 is 0.888, which leaves 11.2% of chance where no player wins/they all tie
- deleted 4y ago[deleted]
- monktastic1 4y agoI mean sure I like a little "choose the smallest number" on the weekends, but I wouldn't say I'm a fiend. Gosh.
- civilized 4y agoYou don't have to be one, you just want to play with some. I recommend sacrificing a goat.