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

A non-cooperative model of network formation is developed. Agents form links with others based on the cost of the link and its assessed benefit. Link formation is one-sided, i.e., agents can initiate links with other agents without their consent, provided the agent forming the link makes the...