Heterogeneity and chaos in congestion games

Abstract

We analyze a class of congestion games where agents use resources to send a finite amount of goods from an initial location to a terminal one. The resources are costly and costs are load dependent. In this context we concentrate on the heterogeneity because we not only assume that agents have limited computational capability but also they differ in the quantities they must send and the reactivity. We introduce an appropriate dynamical system, which has the steady state exactly at the unique Nash equilibrium of the static congestion game, and we investigate the dynamical behavior of the game. We provide a closed form characterization on the unique Nash equilibrium in the underlying static con..