The GM-rule Nash equilibrium conjecture for exact slow NIM
Statement
Consider the exact slow game NIM for players: a position is a non-negative -vector, players move cyclically, and on each move a player keeps one entry unchanged and decreases each of the other positive entries by . A position with at least two non-positive entries is terminal; the player whose turn it is loses, and the other players share the payoff , where is the play length and exceeds the length of every play from the initial position. The GM-rule specifies a strategy for each player, including the move that keeps the largest entry when no entry is a multiple of . GM-rule Nash equilibrium conjecture. The set of GM-strategies forms a uniform Nash equilibrium. The claim concerns the strategic behavior induced by the GM-rule in the multiplayer exact slow NIM game; the supplied text does not state whether it has been proved or disproved.
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.