News for hackers. Stuff that matters.
Re:AI Beats Four Top Poker Players by __s on Tuesday January 31, 2017 @07:50PM (#13537062)
Key example of that Nash point is Rock Paper Scissors. You can't exploit anybody playing 100% random, yet that's the Nash Equilibrium. RPSAI competitions tend to have 100% random players perform quite poorly
Re:AI Beats Four Top Poker Players by tripzilch on Saturday February 04, 2017 @01:51PM (#13568332)
> RPSAI competitions tend to have 100% random players perform quite poorly

Not as much "quite poorly" but more specifically, they will provably land at exactly the median position in the ranking (let's assume there's only one pure random bot in the tournament, no reason to have more than one, but the argument also works with multiple).

While it's impossible to win more than 50% of the time from a pure random RPS bot, it's also impossible to lose more than 50% of the time.

So all the other AIs will on average score exactly 50% against the random RPS bot. Whether they end up in the final ranking above or below this median line depends on how well they do against each other.

Re:AI Beats Four Top Poker Players by thefalcon on Tuesday January 31, 2017 @08:36PM (#13537355)
Do you mean to say that 100% random RPSAIs have a lower winrate vs humans than RPSAIs that learn and exploit human patterns? Surely a 100% random RPSAI doesn't have a poor win rate against any other RPSAI?
Re:AI Beats Four Top Poker Players by T-hawk on Tuesday January 31, 2017 @09:35PM (#13537681)
A 100% random RPS AI doesn't have a poor 1-on-1 win rate against any other RPS AI, but it absolutely can have a poor rate of winning tournaments, if "poor" is defined broadly enough. For a tournament that pays cash to the top 10%, most human players would consider anything in the bottom 90% to be poor, which would include a 50% win rate from a random AI.

This happens because some entrants aren't 100% random, and the worse of them can be exploited by the better of them. What happens is that the results involving any random AI essentially degenerate into noise, while the tournament is really contested between the nonrandom entrants and will be won by the one of them with the best strategy.

Put another way: to win or place highly in a tournament, you don't just want expected win-rate, you want variance. If there is no difference in reward between a 50% win-rate versus a 10% win-rate (both are far out of the money), but there is a big difference between a 50% win-rate and a 90% win-rate (the latter wins the tournament), you will seek the 90% at the cost of potentially ending up at 10%.

Re:AI Beats Four Top Poker Players by _dps on Tuesday January 31, 2017 @11:15PM (#13538177)
To add something, and to clarify (though I don't think you've made any mistake here, but many people misunderstand this subject):

The 33%-each Nash Equilibrium is the mixed strategy Nash Equilibrium of the micro game (i.e. a single round of RPS, averaged over all possible randomizations).

This is in no way the Nash strategy of the tournament game, which is "win the tournament given a pool of unknown participants and a set of rules for whom you face when". You have to add additional assumptions (e.g. that everyone else is going to play the uniform random strategy) in order for uniform random to be the Nash strategy for the tournament game.

If the pool includes players who deviate from the single-round nash equilibrium strategy, there is opportunity to exploit them (and in doing so, open yourself to possible exploitation). This is why pure random play can often perform very poorly at the tournament game.

Re:AI Beats Four Top Poker Players by BigJono on Wednesday February 01, 2017 @07:17AM (#13540108)
> You have to add additional assumptions (e.g. that everyone else is going to play the uniform random strategy) in order for uniform random to be the Nash strategy for the tournament game.

Isn't that literally what a Nash Equilibrium is though? It's my understanding that if there is players playing exploitably in the game then it cannot (by definition) be a Nash Equilibrium, so the Nash strategy may no longer be the optimal or maximally exploitative one.

Re:AI Beats Four Top Poker Players by xapata on Wednesday February 01, 2017 @11:23PM (#13548094)
Correct. Nash equilibrium exists only if everyone takes the equilibrium-seeking strategy.
Re:AI Beats Four Top Poker Players by xapata on Tuesday January 31, 2017 @11:24PM (#13538218)
Similarly, poker tournaments are only profitable for a professional because so many weak players will register -- the "dead money" so to speak.
Re:AI Beats Four Top Poker Players by thefalcon on Wednesday February 01, 2017 @01:59PM (#13543754)
Thanks, I understand now what you're saying.