Asymptotically Truthful Equilibrium Selection in Large Congestion Games

Understand

Studying games in the complete information model makes them analytically tractable.

• However, large $n$ player interactions are more realistically modeled as games of incomplete information, where players may know little to nothing about the types of other players.
• Unfortunately, games in incomplete information settings lose many of the nice properties of complete information games: the quality of equilibria can become worse, the equilibria lose their ex-post properties, and coordinating on an equilibrium becomes even more difficult.
• Because of these problems, we would like to study games of incomplete information, but still implement equilibria of the complete information game induced by the (unknown) realized player types.