Fetching the paper…
Reading the bibliography…
The Multiplicative Weights Update (MWU) method is a ubiquitous meta-algorithm that works as follows: A distribution is maintained on a certain set, and at each step the probability assigned to element $\gamma$ is multiplied by $(1 -\epsilon C(\gamma))>0$ where $C(\gamma)$ is the "cost" of element $\gamma$ and then rescaled to ensure that the new values form a distribution.
Co-existence of cycles of a continuous mapping of the line into itself
A.N. Sharkovskii · 1964
Earlier work this paper cites.
An inequality with applications to statistical estimation for probabilistic functions of markov processes and to a model of ecology
Leonard E. Baum and J. A. Eagon · 1967
Earlier work this paper cites.
A class of games possessing pure-strategy Nash equilibria
R.W. Rosenthal · 1973
Earlier work this paper cites.
Period three implies chaos
Tien-Yien Li and James A. Yorke · 1975
Earlier work this paper cites.
Potential games
D. Monderer and L. S. Shapley · 1996
Earlier work this paper cites.
A gentle tutorial of the em algorithm and its application to parameter estimation for gaussian mixture and hidden markov models
Jeff A Bilmes et al · 1998
Earlier work this paper cites.
The Theory of Learning in Games
Drew Fudenberg and David K. Levine · 1998
Earlier work this paper cites.
Evolutionary Games and Population Dynamics
J. Hofbauer and K. Sigmund · 1998
Earlier work this paper cites.
Worst-case equilibria
Elias Koutsoupias and Christos H. Papadimitriou · 1999
Earlier work this paper cites.
Nonlinear Dynamics and Chaos
Steven Strogatz · 2000
Earlier work this paper cites.
How bad is selfish routing?
Tim Roughgarden and Éva Tardos · 2002
Earlier work this paper cites.
Hidden markov models and the baum-welch algorithm
Lloyd R Welch · 2003
Earlier work this paper cites.
Selfish unsplittable flows
Dimitris Fotakis, Spyros Kontogiannis, and Paul Spirakis · 2004
Cited alongside, same era.
The price of anarchy of finite congestion games
G Christodoulou and E. Koutsoupias · 2005
Cited alongside, same era.
Prediction, Learning, and Games
Nikolo Cesa-Bianchi and Gabor Lugoisi · 2006
Cited alongside, same era.
Distributed selfish load balancing
Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, and Russell Martin · 2007
Cited alongside, same era.
Atomic congestion games: Fast, myopic and concurrent
Dimitris Fotakis, Alexis C. Kaporis, and Paul G. Spirakis · 2008
Cited alongside, same era.
Concurrent imitation dynamics in congestion games
Heiner Ackermann, Petra Berenbrink, Simon Fischer, and Martin Hoefer · 2009
Cited alongside, same era.
Beyond the Nash equilibrium barrier
R. Kleinberg, K. Ligett, G. Piliouras, and É. Tardos · 2011
Later among the works it cites.
Load balancing without regret in the bulletin board model
R. Kleinberg, G. Piliouras, and É. Tardos · 2011
Later among the works it cites.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Later among the works it cites.
The weighted majority algorithm does not converge in nearly zero-sum games
Maria-Florina Balcan, Florin Constantin, and Ruta Mehta · 2012
Later among the works it cites.
Multiplicative updates in coordination games and the theory of evolution
Erick Chastain, Adi Livnat, Christos H. Papadimitriou, and Umesh V. Vazirani · 2013
Later among the works it cites.
Distributed selfish load balancing on networks
P. Berenbrink, M. Hoefer, and T. Sauerwald · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Multiplicative updates outperform generic no-regret learning in congestion games
Robert Kleinberg, Georgios Piliouras, and Éva Tardos · 2009
Cited alongside, same era.
Intrinsic robustness of the price of anarchy
Tim Roughgarden · 2009
Cited alongside, same era.
On learning algorithms for Nash equilibria
C. Daskalakis, R. Frongillo, C. Papadimitriou, G. Pierrakos, and G. Valiant · 2010
Cited alongside, same era.
On the inefficiency of equilibria in linear bottleneck congestion games
Bart de Keijzer, Guido Schäfer, and Orestis A. Telelis · 2010
Cited alongside, same era.
Efficient computation of approximate pure nash equilibria in congestion games
I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik · 2011
Cited alongside, same era.
Convergence to approximate nash equilibria in congestion games
S. Chien and A. Sinclair · 2011
Cited alongside, same era.
Later among the works it cites.
Algorithms, games, and evolution
Erick Chastain, Adi Livnat, Christos Papadimitriou, and Umesh Vazirani · 2014
Later among the works it cites.
Optimization despite chaos: Convex relaxations to complex limit sets via Poincaré recurrence
G. Piliouras and J. S. Shamma · 2014
Later among the works it cites.
Natural selection as an inhibitor of genetic diversity: Multiplicative weights updates algorithm and a conjecture of haploid genetics
Ruta Mehta, Ioannis Panageas, and Georgios Piliouras · 2015
Later among the works it cites.
A note on sex, evolution, and the multiplicative updates algorithm
Reshef Meir and David Parke · 2015
Later among the works it cites.
Evolutionary stability implies asymptotic stability under multiplicative weights
Ioannis Avramopoulos · 2016
Later among the works it cites.
From nash equilibria to chain recurrent sets: Solution concepts and topology
Christos Papadimitriou and Georgios Piliouras · 2016
Later among the works it cites.