Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation

► We analyze variants of the learning process known as log-linear learning. ► We consider synchronous moves, constrained moves, and payoff measurements. ► Under suitable variants, potential function maximizers remain stochastically stable. ► Proofs use resistance trees methods, and not an explicit stationary distribution.