Strong convergence conjecture for imitation dynamics
Statement
Let be a game matrix and let be a learning rate. Let denote the relevant maximal-set quantity in the imitation dynamics, and let be a learning-rate bound. Strong convergence conjecture. For every game matrix , there exists a learning rate such that the imitation dynamics always converge when . The source presents this as the second of two general convergence conjectures and leaves it as an open problem; no proof or resolution is given.
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.