Sciweavers

Share
ICC
2009
IEEE

A Game-Theoretic Analysis of Inter-Session Network Coding

9 years 19 hour ago
A Game-Theoretic Analysis of Inter-Session Network Coding
Abstract— A common assumption in the network coding literature is that the users are cooperative and will not pursue their own interests. However, this assumption can be violated in practice. In this paper, we analyze inter-session network coding in a wired network, assuming that the users are selfish and act as strategic players to maximize their own utility. We prove the existence of Nash equilibria for a wide range of utility functions. The number of Nash equilibria can be large (even infinite) under certain conditions, which is in sharp contrast to a similar game setting with traditional packet forwarding. We then characterize the worst-case efficiency bounds, i.e., the price-ofanarchy (PoA), compared to an optimal and cooperative network design. We show that by using a novel discriminatory pricing scheme that charges encoded and forwarded packets differently, we can improve PoA in comparison with the case where a single pricing scheme is being used. However, PoA is still wors...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W
Added 21 May 2010
Updated 21 May 2010
Type Conference
Year 2009
Where ICC
Authors Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W. S. Wong, Sidharth Jaggi, Robert Schober
Comments (0)
books