<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>Central Paths and Selection of Equilibria</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">A.V.</mods:namePart><mods:namePart type="family">Kryazhimskiy</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">G.</mods:namePart><mods:namePart type="family">Sonnevend</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>For two populations of players playing repeatedly a same bimatrix game, a dynamics associated with the method of analytic centers for linear programming is described. All populations' evolutions converge to static equilibria. All evolutions starting in a same connected set converge to a same equilibrium. If a starting time is sufficiently large, "almost all" evolutions end up at a single equilibrium representing all populations' pure strategy groups (phenotypes) with nonzero proportions. The dynamics is interpreted as populations' rule to learn best replying.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1996-04</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>WP-96-039</mods:publisher></mods:originInfo><mods:genre>Monograph</mods:genre></mods:mods>