Action-Graph Games

► Action-Graph Games (AGGs) are a fully-expressive game representation. ► AGGs can compactly express utility functions with a wide variety of structure. ► We give a polynomial-time algorithm for computing expected utilities for AGGs. ► We leverage this to achieve exponential speedups of algorithms for Nash equilibria. ► Computational experiments show large improvements over previous techniques.