Hart, Sergiu; Mansour, Yishay - In: Simple Adaptive Strategies:From Regret-Matching to …
AbstractWe study the question of how long it takes players to reach a Nash equilibrium in uncoupled setups, where each player initially knows only his own payoff function. We derive lower bounds on the communication complexity of reaching a Nash equilibrium, i.e., on the number of bits that need...