Payoff imbalance in Nash equilibria of the imbalanced (m,2k+1)-RPS game
Statement
Consider the given imbalanced -RPS game and a Nash equilibrium . Let be the probability that player plays , and let be the probability that player plays any -type object. Imbalance conjecture. For every player ,
Moreover, for any and player , the expected number of other players tying with for the win occurring for is less than . The conjecture is intended to support a proof that the constructed imbalanced -RPS game is strongly playable; the source offers only a heuristic based on the rapidly decreasing probability of playing in the symmetric three-object Nash equilibrium.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.