Anyhow, I came up with another question while considering this problem. Player 1 should only bluff at the optimal rate if player 2 punishes them for deviating from this rate by changing the frequency that they call when holding the king. Otherwise, Player 1 gains more on average by bluffing with the queen more frequently. So, how should Player 2 figure out if Player 1 is actually bluffing at the optimal rate (and not higher)? It could happen, with exponentially small probability, that Player 1 decides whether to bluff randomly, and bluffs with the first 10,000 queens before ever folding with a queen. How does Player 2 distinguish this from Player 1 only ever bluffing with the queen?
But perhaps this is something that the Nash Theorem deals with? I don't know. Any comments from people who know more than me on this are welcome!