Inefficient noncooperation in networking games of common-pool resources
We study in this paper a noncooperative approach for sharing resources of a common pool
among users, wherein each user strives to maximize its own utility. The optimality notion is …
among users, wherein each user strives to maximize its own utility. The optimality notion is …
Optimal flow control and capacity allocation in multi-service networks
SH Rhee, T Konstantopoulos - … of the 37th IEEE Conference on …, 1998 - ieeexplore.ieee.org
The optimal flow control of noncooperative users in multiservice networks is investigated in a
game-theoretic way. We adopt a model that differs from previously considered ones in that a …
game-theoretic way. We adopt a model that differs from previously considered ones in that a …
Nash equilibrium based fairness
There are several approaches of sharing resources among users. There is a noncooperative
approach wherein each user strives to maximize its own utility. The most common optimality …
approach wherein each user strives to maximize its own utility. The most common optimality …
Atomic resource sharing in noncooperative networks
In noncooperative networks, resources are shared among selfish users, which optimize their
individual performance measure. We consider the generic and practically important case of …
individual performance measure. We consider the generic and practically important case of …
Atomic resource sharing in noncooperative networks
In noncooperative networks, resources are shared among selfish users, which optimize their
individual performance measure. We consider the generic and practically important case of …
individual performance measure. We consider the generic and practically important case of …
Virtual path bandwidth allocation in multiuser networks
We consider a multiuser network that is shared by noncooperative users. Each user sets up
virtual paths that optimize its own selfish performance measure. This measure accounts for …
virtual paths that optimize its own selfish performance measure. This measure accounts for …
The designer's perspective to noncooperative networks
A noncooperative network is considered, in which each user routes its flow in a way that
optimizes its individual performance objective. Nash equilibria characterize the operating …
optimizes its individual performance objective. Nash equilibria characterize the operating …
[PDF][PDF] Network resource allocation and a congestion game
R Johari, JN Tsitsiklis - Proceedings of the Annual Allerton Conference on …, 2003 - Citeseer
We explore the properties of a congestion game where users of a congested resource
anticipate the effect of their actions on the price of the resource. When users are sharing a …
anticipate the effect of their actions on the price of the resource. When users are sharing a …
Capacity allocation under noncooperative routing
The capacity allocation problem in a network that is to be shared by noncooperative users is
considered. Each user decides independently upon its routing strategy so as to optimize its …
considered. Each user decides independently upon its routing strategy so as to optimize its …
Network resource allocation and a congestion game: The single link case
R Johari, JN Tsitsiklis - … on Decision and Control (IEEE Cat. No …, 2003 - ieeexplore.ieee.org
We explore the properties of a congestion game where users of a congested resource
anticipate the effect of their actions on the price of the resource. When users are sharing a …
anticipate the effect of their actions on the price of the resource. When users are sharing a …