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...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Abstract—This paper provides an overview of an implementation of Differentiated Services interior and boundary nodes as described in the SIMA model. The operation of the network ...
Juha Laine, Sampo Saaristo, Jussi Lemponen, Jarmo ...
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...