Results 1  10
of
112
ROBUST WARDROP EQUILIBRIUM
, 2006
"... Network games can be used to model competitive situations in which players select routes to maximize their utility. Common applications include traffic, telecommunication and distribution networks. Although traditional network models have assumed that utilities only depend on congestion, in most a ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. We define a robust Wardrop equilibrium as a solution under which all players are assigned to an optimal solution to their robust problems. Such a solution always exists and can be computed through efficient column generation methods. We show through a computational study that a robust Wardrop
Wardrop Equilibrium for CDMA Systems
"... Abstract — In this contribution, the performance of an uplink CDMA system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while per ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
explicit expressions for the impact of all other mobiles on any given tagged mobile. The second is the theory of nonatomic games along with the Wardrop equilibrium concept which allows us to compute good approximations of the Nash equilibrium as the number of mobiles grow. 1 I.
Decision, Risk & Operations Working Papers Series ROBUST WARDROP EQUILIBRIUM
, 2006
"... Abstract. Network games can be used to model competitive situations in which players select routes to maximize their utility. Common applications include traffic, telecommunication and distribution networks. Although traditional network models have assumed that utilities only depend on congestion, i ..."
Abstract
 Add to MetaCart
into account. We define a robust Wardrop equilibrium as a solution under which all players are assigned to an optimal solution to their robust problems. Such a solution always exists and can be computed through efficient column generation methods. We show through a computational study that a robust Wardrop
Wardrop Equilibrium Formulation of ResourceConstrained DTN Routing in Public Safety Networks
"... Abstract—In this paper, we investigate the ability of using DTNs in Public Safety networks, where bandwidth and storage are constrained. We formalize the problem as a Wardrop equilibrium over a timediscretized graph. Driven by our findings, we propose RECOR, a centralized REsourceConstrained ORac ..."
Abstract
 Add to MetaCart
Abstract—In this paper, we investigate the ability of using DTNs in Public Safety networks, where bandwidth and storage are constrained. We formalize the problem as a Wardrop equilibrium over a timediscretized graph. Driven by our findings, we propose RECOR, a centralized REsource
1 Reaching approximate Wardrop equilibrium at reduced costs of link state updates
"... Abstract—Several routing protocols have been proposed to take advantage of the dynamic metrics on links such as link delays, queueing lengths, and available link bandwidths. Wardrop routing, QOS routing are few such example routing protocols. Even when these protocols can be shown to offer convergen ..."
Abstract
 Add to MetaCart
Abstract—Several routing protocols have been proposed to take advantage of the dynamic metrics on links such as link delays, queueing lengths, and available link bandwidths. Wardrop routing, QOS routing are few such example routing protocols. Even when these protocols can be shown to offer
A Case where a Paradox Like Braess's Occurs in the Nash Equilibrium but Does Not Occur in the Wardrop Equilibrium  A Situation of Load Balancing in Distributed Computer Systems
, 1999
"... The Braess paradox which was originally identified and observed in road traffic context, shows that it may happen that by adding capacity to the network, the performance of all users degrades. This paradox has long been known in a framework called the Wardrop equilibrium, in which there are infinite ..."
Abstract

Cited by 13 (11 self)
 Add to MetaCart
The Braess paradox which was originally identified and observed in road traffic context, shows that it may happen that by adding capacity to the network, the performance of all users degrades. This paradox has long been known in a framework called the Wardrop equilibrium, in which
Certificate
, 2007
"... This is to certify that the project report titled “ Wardrop Equilibrium and Potential ..."
Abstract
 Add to MetaCart
This is to certify that the project report titled “ Wardrop Equilibrium and Potential
Dynamic CesaroWardrop Equilibration in Networks
 IEEE Transactions on Automatic Control
, 2002
"... We analyze a routing scheme for a broad class of networks which converges (in the Cesaro sense) with probability one to the set of approximate CesaroWardrop equilibria, an extension of the notion of a Wardrop equilibrium. The network model allows for wireline networks where delays are caused by flo ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
We analyze a routing scheme for a broad class of networks which converges (in the Cesaro sense) with probability one to the set of approximate CesaroWardrop equilibria, an extension of the notion of a Wardrop equilibrium. The network model allows for wireline networks where delays are caused
Sensitivity of Wardrop Equilibria
"... We study the sensitivity of equilibria in the wellknown game theoretic traffic model due to Wardrop. We mostly consider singlecommodity networks. Suppose, given a unit demand flow at Wardrop equilibrium, one increases the demand by ε or removes an edge carrying only an εfraction of flow. We study ..."
Abstract
 Add to MetaCart
We study the sensitivity of equilibria in the wellknown game theoretic traffic model due to Wardrop. We mostly consider singlecommodity networks. Suppose, given a unit demand flow at Wardrop equilibrium, one increases the demand by ε or removes an edge carrying only an εfraction of flow. We
Price of anarchy for polynomial Wardrop games
 In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (Eds.), Second International Workshop on Internet and Network Economics (WINE). Patras, Greece. In: Lecture Notes in Computer Science
, 2006
"... Abstract. In this work, we consider Wardrop games where traffic has to be routed through a shared network. Traffic is allowed to be split into arbitrary pieces and can be modeled as network flow. For each edge in the network there is a latency function that specifies the time needed to traverse the ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
the edge given its congestion. In a Wardrop equilibrium, all used paths between a given sourcedestination pair have equal and minimal latency. In this paper, we allow for polynomial latency functions with an upper bound d and a lower bound s on the degree of all monomials that appear in the polynomials
Results 1  10
of
112