Computation of strategic equilibria in game networks

Piero La Mura
Leipzig University

In recent years there has been considerable interest in the topic of tractable representations and algorithms for game theory. Game Networks (La Mura 2000), a family of tractable game-theoretic representations, may afford significant computational advantages over strategic or extensive forms thanks to a modular representation of probabilities, utilities and expected utilities. In this talk, after reviewing the Game Networks formalism, I will discuss computational methods which exploit the structure of Game Networks in order to efficiently find one or all of the Nash equilibria in a game.