Speaker
Luca Dall'Asta
(ICTP)
Description
Game theoretic problems defined on graphs may admit many
Nash equilibria, with very different properties. An example
is provided by strategic substitutes game on network.
Searching for (socially) optimal Nash equilibria in these
games is a non-trivial task. I will discuss some algorithmic
techniques based on Monte Carlo and Belief Propagation as
well as learning methods by means of which players
endogeneously organize toward one or more Nash equilibria.
