Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

JET
2016

favoriteEmaildiscussreport

60views more JET 2016»

Fast convergence in evolutionary models: A Lyapunov approach

8 years 20 days ago

Fast convergence in evolutionary models: A Lyapunov approach

Download www.gsb.stanford.edu

Evolutionary models in which N players are repeatedly matched to play a game have “fast convergence” to a set A if the models both reach A quickly and leave A slowly, where “quickly” and “slowly” refer to whether the expected hitting and exit times remain bounded when N tends to inﬁnity. We provide simple and general Lyapunov criteria which are suﬃcient for reaching quickly and leaving slowly. We use these criteria to determine aspects of learning models that promote fast convergence.

Glenn Ellison, Drew Fudenberg, Lorens A. Imhof

Real-time Traffic

JET 2016 |

claim paper

Related Content

» Graphbased quadratic optimization A fast evolutionary approach

» Parallel Algorithms for Balanced Truncation Model Reduction of Sparse Systems

» Stability analysis of nonlinear quadratic systems via polyhedral Lyapunov functions

» Model predictive flight control using adaptive support vector regression

» Absolute convergence true trees from short sequences

» An approach for the state estimation of TakagiSugeno models and application to sensor faul...

» Evolutionary Approach for Efficient Resource Allocation in MultiUser OFDM Systems

» Fast Detection of Convergence Areas in Digital Breast Tomosynthesis

» Towards a Generally Applicable SelfAdapting Hybridization of Evolutionary Algorithms

» Dynamic multiobjective optimization with evolutionary algorithms a forwardlooking approach

Post Info
More Details (n/a)

Added	06 Apr 2016
Updated	06 Apr 2016
Type	Journal
Year	2016
Where	JET
Authors	Glenn Ellison, Drew Fudenberg, Lorens A. Imhof

Comments (0)