(joint with Karl Schmedders (Nortwestern University))
Dynamic games require solving large polynomials systems,
many in excess of 10^6 equations. However, many games have a directed
acyclic graph structure allowing us to decompose the problem into a
sequence of smaller systems of size 100 to 1000. We describe
applications of homotopy methods to solve such systems, and
computational strategies that exploit numerical algebraic theory
efficiently solve large systems.