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...

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...

Social networks, be it on the internet or in real life, facilitate information flows. We model this by giving agents incentives to link with others and receive information through those links. In many networks agents will value confirmation of the information they receive from others. Our paper...