EconStor >
Deutsches Institut für Wirtschaftsforschung (DIW), Berlin >
DIW-Diskussionspapiere >

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10419/18282
  
Title:Strategic path reliability in information networks PDF Logo
Authors:Kannan, Rajgopal
Sarangi, Sudipta
Iyengar, Sundaraja Sitharama
Issue Date:2002
Series/Report no.:DIW-Diskussionspapiere 298
Abstract: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 analytical results to identify conditions under which the equilibrium path is congruent to well known paths such as the most reliable or cheapest neighbor path. The issue of characterizing off-equilibrium paths in the game is addressed and different path utility metrics proposed. Our first metric measures the degree of individual node suboptimality by evaluating paths in terms of the weakness of the worst-off player. It is shown that there exist information networks not containing paths of weakness less than Vr/3. Consequently, guaranteeing approximate equilibrium paths of bounded weakness is computationally difficult. We next propose a team game with players having a common payoff function whose equilibrium outcome can be computed in polynomial time. Finally, a fair team game with bounded payoff difference is proposed whose equilibrium is also easily computable.
Subjects:Nash Networks
Equilibrium Complexity
Team Games
JEL:C72
D83
Document Type:Working Paper
Appears in Collections:Publikationen von Forscherinnen und Forschern des DIW
DIW-Diskussionspapiere

Files in This Item:
File Description SizeFormat
dp298.pdf584.17 kBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:http://hdl.handle.net/10419/18282

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.