Results 1  10
of
16
To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems
 INTERNATIONAL SERIES IN OPERATIONS RESEARCH & MANAGEMENT SCIENCE, SPRINGER (HARDCOVER) 16 C.H. (2006), “HETEROGENEOUS AGENT MODELS IN ECONOMICS AND FINANCE,” HANDBOOK OF COMPUTATIONAL ECONOMICS, LEIGH TESFATSION
"... ..."
Network Routing
 Phil. Trans. R. Soc. Lond. A,337
, 1991
"... How should flows through a network be organized, so that the network responds sensibly to failures and overloads? The question is currently of considerable technological importance in connection with the development of computer and telecommunication networks, while in various other forms it has a lo ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
How should flows through a network be organized, so that the network responds sensibly to failures and overloads? The question is currently of considerable technological importance in connection with the development of computer and telecommunication networks, while in various other forms it has a long history in the fields of physics and economics. In all of these areas there is interest in how simple, local rules, often involving random actions, can produce coherent and purposeful behaviour at the macroscopic level. This paper describes some examples from these various fields, and indicates how analogies with fundamental concepts such as energy and price can provide powerful insights into the design of routing schemes for communication networks.
A MultiAgent, PolicyGradient approach to Network Routing
 In: Proc. of the 18th Int. Conf. on Machine Learning
, 2001
"... Network routing is a distributed decision problem which naturally admits numerical performance measures, such as the average time for a packet to travel from source to destination. Olpomdp, a policygradient reinforcement learning algorithm, was successfully applied to simulated network routing unde ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Network routing is a distributed decision problem which naturally admits numerical performance measures, such as the average time for a packet to travel from source to destination. Olpomdp, a policygradient reinforcement learning algorithm, was successfully applied to simulated network routing under a number of network models. Multiple distributed agents (routers) learned cooperative behavior without explicit interagent communication, and they avoided behavior which was individually desirable, but detrimental to the group's overall performance. Furthermore, shaping the reward signal by explicitly penalizing certain patterns of suboptimal behavior was found to dramatically improve the convergence rate.
Braess' Paradox in a Loss Network
, 1995
"... Braess' paradox is said to occur in a network if the addition of an extra link leads to worse performance. It has been shown to occur in transportation networks (such as road networks) and also in queueing networks. Here, we show that it can occur in loss networks. ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Braess' paradox is said to occur in a network if the addition of an extra link leads to worse performance. It has been shown to occur in transportation networks (such as road networks) and also in queueing networks. Here, we show that it can occur in loss networks.
Avoiding Paradoxes in Routing Games
 Proceedings of the 17th International Teletraffic Congress
, 2001
"... Strange behavior may occur in networks due to the noncooperative nature of decision making, when the latter are taken by individual agents. In particular, the well known... ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Strange behavior may occur in networks due to the noncooperative nature of decision making, when the latter are taken by individual agents. In particular, the well known...
Stationary Ergodic Jackson Networks: Results and CounterExamples
, 1996
"... This paper gives a survey of recent results on generalized Jackson networks, where classical exponential or i.i.d. assumptions on services and routings are replaced by stationary and ergodic assumptions. We first show that the most basic features of the network may exhibit unexpected behavior. Sever ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This paper gives a survey of recent results on generalized Jackson networks, where classical exponential or i.i.d. assumptions on services and routings are replaced by stationary and ergodic assumptions. We first show that the most basic features of the network may exhibit unexpected behavior. Several probabilistic properties are then discussed, including a strong law of large numbers for the number of events in the stations, the existence, uniqueness and representation of stationary regimes for queue size and workload.
Properties of Equilibria in Competitive Routing with Several User Types
 In Proceedings of the 41st IEEE Conference on Decision and Control
, 2001
"... In recent years there has been a growing interest in mathematical models for routing in networks in which the decisions are taken in a noncooperative way. Instead of a single decision maker (that may represent the network) that chooses the routes so as to maximize a global utility, one considers a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In recent years there has been a growing interest in mathematical models for routing in networks in which the decisions are taken in a noncooperative way. Instead of a single decision maker (that may represent the network) that chooses the routes so as to maximize a global utility, one considers a number of decision makers having each its own utility to maximize by routing its own flow. This gives rise to the use of noncooperative game theory and the Nash equilibrium concept for optimality. In the special case in which each decision maker wishes to find a minimal path for each routed object (e.g. a packet) then the solution concept is the Wardrop equilibrium. It is well known that equilibria may exhibit inefficiencies and paradoxical behaviour, such as the famous Braess paradox (in which the addition of a link to a network results in worse performance to all users). This raises the challenge for the network administrator of how to upgrade the network so that it indeed results in improved performance. We present in this paper some guidelines for that.
Avoiding Paradox in Routing Games in Networks when Travel Demand is Elastic
 Proceedings of the Tenth Symposium on Dynamic Games and Applications
, 2002
"... In recent years has been a growing interest in mathematical models for routing in networks in which the decision are taken in a noncooperative way. Instead of a single decision maker (that may represent the network ) that chooses the route so as to maximize a global utility, one considers a number ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In recent years has been a growing interest in mathematical models for routing in networks in which the decision are taken in a noncooperative way. Instead of a single decision maker (that may represent the network ) that chooses the route so as to maximize a global utility, one considers a number of decision makers having each its own utility to maximize by routing its own flow. This gives rise to the use of noncooperative game theory and the Nash equilibrium concept for optimality.
ATIS at Rush Hour: Adaptation and Departure Time Coordination in Iterated Commuting
, 1997
"... Morning commuters adjust their departure times in response to daytoday changes in congestion. Advanced Traveler Information Systems (ATIS) may enable motorists to employ fundamentally new strategies when adapting their departure times to fluctuations in congestion. At the same time, new driver ..."
Abstract
 Add to MetaCart
Morning commuters adjust their departure times in response to daytoday changes in congestion. Advanced Traveler Information Systems (ATIS) may enable motorists to employ fundamentally new strategies when adapting their departure times to fluctuations in congestion. At the same time, new driver strategies will likely give rise to different road network behaviors. This paper explores the mutual feedback between driver strategy and traffic system performance through a simulation model of rush hour commuting. Motorists in this model choose departure times according to three adaptive strategies. When commuters apply adaptive strategies that require ATIS in the present model, outcomes for both individual motorists and the system as a whole are by several measures worse than when drivers use a simple strategy that does not require ATIS. These results largely agree with an earlier study of a nearly identical model of rushhour commuting. This document is available in HTML on the ...
A Paradox in Optimal Flow Control of M/M/m Queues
"... Optimal flow control problems of multipleserver (M/M/m) queueing systems are studied. Due to enhanced flexibility of the decision making, intuitively, we expect that grouping together separated systems into one system provides improved performance over the previously separated systems. This paper p ..."
Abstract
 Add to MetaCart
Optimal flow control problems of multipleserver (M/M/m) queueing systems are studied. Due to enhanced flexibility of the decision making, intuitively, we expect that grouping together separated systems into one system provides improved performance over the previously separated systems. This paper presents a counterintuitive result. We consider a noncooperative optimal flow control problem of M/M/m queueing systems where each player strives to optimize unilaterally its own power where the power of a player is the quotient of the throughput divided by the mean response time for the player. We report a counterintuitive case where the power of every user degrades after grouping together K(> 1) separated M/M/N systems into a single M/M/(KN)system.