Game Theory: Is there an "unexploitable" strategy in No Limit Holdem? Do "unexploitable" strategy exist in No Limit Holdem? By this I mean frequency-based mixed strategy that has non-negative expected payoff against any other strategy (let's assume the game is completely symmetric, seats are randomly assigned to all players).
From my very basic understanding of game theory, I would say that for a 2-player game the answer is yes because any equilibrium strategy (which should exist, right?) will do the job. But what if there are >2 players?
I'm interested in a proof for the (non-)existence of such a strategy.
EDIT #1:
As pointed out by vadim123, we should assume collusion is impossible. 
EDIT #2: 
After thinking about it for a bit, I'm actually not sure whether collusion matters at all. Maybe someone can show a concrete example (with some kind of formal proof)?
 A: The answer is no, without additional restrictions.  Otherwise the other players simply collude, and only the best hand among them bets while the others fold.  Hence you are betting your hand against the best of $(n-1)$ hands, and the expectation of that is negative.
Okay, here's another collusion strategy.  The first hand when you fold, all other players go all-in.  Consequently, instead of $n$ players with equal bankrolls, you have your same bankroll but now you have one opponent with a bankroll $(n-1)$ times larger than you.
There's a reason two-player games are well-studied, while $n$-player games are not.  It's much harder, even with unintentional collusion that takes advantage of bad players.
A: vadim123 is correct: with more than two players, you are vulnerable to collusion. This collusion may take place (illegally) during the game, or (probably still illegally) by agreements made before the game. It may even be unintended, as when you find yourself playing against a married couple who will obviously not want to step on each other's toes.
But, as you suspect, in a two-player game there is always a mixed strategy that gives you a non-negative expectation. (It may be -- I don't know -- that being first to deal gives you a very slight edge over your opponent, but we can ignore this subtlety if we start the game by drawing lots to see who deals.)
For a two-player game, the real question is: does there exist such a strategy that has a positive expectation if your opponent plays badly? For example, in rock-paper-scissors, the only good strategy from a game-theoretical point of view is always to choose your move at random. But this means that your expectation is 0, no matter how your opponent plays.
However, poker is more complex than rock-paper-scissors. It seems likely that if you play perfect poker (in the sense that your expectation is non-negative whatever your opponent does), then your opponent will have plenty of room for error, and you will win over the long run against anybody on the planet. But I can't back this up with anything like a convincing argument.
A: Unless I'm missing something, the answer is "no" via a very simple argument. (EDIT: I was thinking of "strictly positive" expected value, which the argument below argues against.)
Suppose the game is completely symmetric (i.e. the strategy set of each player is the same). Suppose the game is zero-sum (i.e. the total payoffs of all players add up to zero). Note this implies that, in expectation, the total payoffs added up over all players is zero (since it is zero in every case).
Then there is no strategy that guarantees positive expected value. If there were, then every player could play that strategy simultaneously, and they would all expect to win some strictly positive amount. So the expected total payoff (added up over all players) would be some positive amount, which contradicts the game being zero-sum.
The only question I have is if you think those assumptions are valid for this setting or not -- they seem to capture what you're asking.
