Computational Evolutionary Game Theory
Stub. Evolutionarily stable strategies and the complexity of computing them, evolutionary dynamics applied to selfish routing, and evolutionary game theory played over graphs. (AGT ch. 29)
An alternative, dynamics-based (rather than rationality-based) equilibrium concept: evolutionarily stable strategies, the computational complexity of finding them, how evolutionary dynamics behave when applied to selfish routing (does replicator dynamics converge to the Nash flow?), and evolutionary game theory played on graphs instead of well-mixed populations.
Outline (TODO — flesh out each)
- Evolutionary game theory basics — evolutionarily stable strategies
- The computational complexity of evolutionarily stable strategies
- Evolutionary dynamics applied to selfish routing
- Evolutionary game theory over graphs
- Future work