Algorithms, Games and Evolution

Speaker: Umesh Vazirani , UC Berkeley

Date: Wednesday, May 14, 2014

Time: 1:30 PM to 3:00 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: 32-G575

Event Type:

Room Description:

Host: Scott Aaronson, TOC, CSAIL, MIT

Contact: Holly A Jones, hjones01@csail.mit.edu

Relevant URL: http://toc.csail.mit.edu/node/574

Speaker URL: None

Speaker Photo:
None

Reminders to: toc@csail.mit.edu, theory-seminars@csail.mit.edu, seminars@csail.mit.edu

Reminder Subject: TALK: Algorithms, Games and Evolution

Special Day and Time!
Abstract: Even the most seasoned students of evolution, starting with Darwin himself, have occasionally expressed amazement that the mechanism of natural selection has produced all of life as we see it around us. Or stated from a computational viewpoint, what algorithm could possibly achieve all this in about 10^12 generations (steps)? We demonstrate that in the regime of weak selection, the standard equations of population genetics describing natural selection in the presence of sex become identical to those of a repeated game between genes played according to multiplicative weight updates (MWUA), an algorithm known to be surprisingly powerful and versatile. MWUA maximizes a trade-off between cumulative performance and entropy, which suggests a new view on the maintenance of diversity in evolution.

Based on joint work with Erick Chastain, Adi Livnat and Christos Papadimitriou

Research Areas:

Impact Areas:

See other events that are part of the Theory of Computation Colloquium - 2014.

Created by Holly A Jones Email at Tuesday, May 06, 2014 at 1:42 PM.