Kannan, Rajgopal; Sarangi, Sudipta; Iyengar, S. S. - DIW Berlin (Deutsches Institut für Wirtschaftsforschung) - 2002
We consider a model of an information network where nodes can fail and transmission of information is costly. The formation of paths in such networks is modeled as the Nash equilibrium of an N player routing game. The task of obtaining this equilibrium is shown to be NP-Hard. We derive...
