-
1
-
-
33646386723
-
Avoiding paradoxes in routing games
-
Salvador da Bahia, Brazil, September 24-28
-
Altman, E., El Azouzi, R., and Pourtallier, O. (2001). Avoiding paradoxes in routing games. Proceedings of the 17th International Teletraffic Congress, Salvador da Bahia, Brazil, September 24-28.
-
(2001)
Proceedings of the 17th International Teletraffic Congress
-
-
Altman, E.1
El Azouzi, R.2
Pourtallier, O.3
-
2
-
-
0016495143
-
Open, closed and mixed networks of queues with different classes of customers
-
Baskett, F., Chandy, K. M., Muntz, R. R., and Palacios, F. (1975). Open, closed and mixed networks of queues with different classes of customers. Journal of the ACM, 22(2):248-260.
-
(1975)
Journal of the ACM
, vol.22
, Issue.2
, pp. 248-260
-
-
Baskett, F.1
Chandy, K.M.2
Muntz, R.R.3
Palacios, F.4
-
3
-
-
0031082696
-
Braess's paradox in a loss network
-
Beans, N. G., Kelly, F. P., and Taylor, P. G. (1997). Braess's paradox in a loss network. Journal of Applied Probability, 34:155-159.
-
(1997)
Journal of Applied Probability
, vol.34
, pp. 155-159
-
-
Beans, N.G.1
Kelly, F.P.2
Taylor, P.G.3
-
4
-
-
34250513249
-
Uber ein Paradoxen aus der Verkehrsplanung
-
Braess, D. (1968). Uber ein Paradoxen aus der Verkehrsplanung. Unternehmensforschung, 12:258-268.
-
(1968)
Unternehmensforschung
, vol.12
, pp. 258-268
-
-
Braess, D.1
-
5
-
-
0031082739
-
Braess's paradox in a queueing network with state-dependent routing
-
Calvert, B., Solomon, W., and Ziedins, I. (1997). Braess's paradox in a queueing network with state-dependent routing. Journal of Applied Probability, 34:134-154.
-
(1997)
Journal of Applied Probability
, vol.34
, pp. 134-154
-
-
Calvert, B.1
Solomon, W.2
Ziedins, I.3
-
6
-
-
0031123353
-
Congestion resulting from increased capacity in single-server queueing networks
-
Cohen, J. E. and Jeffries, C. (1997). Congestion Resulting from Increased Capacity in Single-Server Queueing Networks. IEEE/ACM Transactions on Networking, 5(2):1220-1225.
-
(1997)
IEEE/ACM Transactions on Networking
, vol.5
, Issue.2
, pp. 1220-1225
-
-
Cohen, J.E.1
Jeffries, C.2
-
7
-
-
0000328390
-
A paradox of congestion in a queueing network
-
Cohen, J. E. and Kelly, F. P. (1990). A Paradox of Congestion in a Queueing Network. Journal of Applied Probability, 27:730-734.
-
(1990)
Journal of Applied Probability
, vol.27
, pp. 730-734
-
-
Cohen, J.E.1
Kelly, F.P.2
-
8
-
-
0021405975
-
On some traffic equilibrium theory paradoxes
-
Dafermos and Nagurney, A. (1984a). On some traffic equilibrium theory paradoxes. Transportation Research B, 18:101-110.
-
(1984)
Transportation Research B
, vol.18
, pp. 101-110
-
-
Dafermos1
Nagurney, A.2
-
9
-
-
0021371581
-
Sensitivity analysis for the asymmetric network equilibrium problem
-
Dafermos and Nagurney, A. (1984b). Sensitivity analysis for the asymmetric network equilibrium problem. Mathematical Programming, 28:174-184.
-
(1984)
Mathematical Programming
, vol.28
, pp. 174-184
-
-
Dafermos1
Nagurney, A.2
-
11
-
-
4243202772
-
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
-
Kameda, H. and Pourtallier, O. (2002). Paradoxes in Distributed Decisions on Optimal Load Balancing for Networks of Homogeneous Computers. Journal of the ACM, 49(3):407-433.
-
(2002)
Journal of the ACM
, vol.49
, Issue.3
, pp. 407-433
-
-
Kameda, H.1
Pourtallier, O.2
-
12
-
-
0000718217
-
Uniqueness of the solution for optimal static routing in open BCMP queueing networks
-
Kameda, H. and Zhang, Y. (1995). Uniqueness of the solution for optimal static routing in open BCMP queueing networks. Mathematical and Computer Modelling, 22 (10-12):119-130.
-
(1995)
Mathematical and Computer Modelling
, vol.22
, Issue.10-12
, pp. 119-130
-
-
Kameda, H.1
Zhang, Y.2
-
13
-
-
0033329357
-
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
-
Phoenix, Arizona, USA
-
Kameda, H., Altman, E., and Kozawa, T. (1999). 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. Proceedings of the 38th IEEE Conference on Decision and Control, Phoenix, Arizona, USA.
-
(1999)
Proceedings of the 38th IEEE Conference on Decision and Control
-
-
Kameda, H.1
Altman, E.2
Kozawa, T.3
-
14
-
-
0034262822
-
Braesslike paradoxes of Nash Equilibria for load balancing in distributed computer systems
-
Kameda, H., Altman, E., Kozawa, T., and Hosokawa, Y. (2000). Braesslike paradoxes of Nash Equilibria for load balancing in distributed computer systems. IEEE Transactions on Automatic Control, 45(9):1687-1691.
-
(2000)
IEEE Transactions on Automatic Control
, vol.45
, Issue.9
, pp. 1687-1691
-
-
Kameda, H.1
Altman, E.2
Kozawa, T.3
Hosokawa, Y.4
-
17
-
-
0029373265
-
Architecting noncooperative networks
-
Korilis, Y. A., Lazar, A. A., and Orda, A. (1995). Architecting noncooperative networks. IEEE Journal on Selected Areas in Communications, 13:1241-1251.
-
(1995)
IEEE Journal on Selected Areas in Communications
, vol.13
, pp. 1241-1251
-
-
Korilis, Y.A.1
Lazar, A.A.2
Orda, A.3
-
18
-
-
0031097909
-
Capacity allocation under non-cooperative routing
-
Korilis, Y. A., Lazar, A. A., and Orda, A. (1997). Capacity allocation under non-cooperative routing. IEEE Transactions on Automatic Control, 42(3):309-325.
-
(1997)
IEEE Transactions on Automatic Control
, vol.42
, Issue.3
, pp. 309-325
-
-
Korilis, Y.A.1
Lazar, A.A.2
Orda, A.3
-
19
-
-
85037920921
-
Avoiding the Braess paradox in non-cooperative networks
-
Korilis, Y. A., Lazar, A. A., and Orda, A. (1999). Avoiding the Braess paradox in non-cooperative networks. Journal of Applied Probability, 36:211-222.
-
(1999)
Journal of Applied Probability
, vol.36
, pp. 211-222
-
-
Korilis, Y.A.1
Lazar, A.A.2
Orda, A.3
-
21
-
-
0027684575
-
Competitive routing in multi-user environments
-
Orda, A., Rom, R., and Shimkin, N. (1993). Competitive routing in multi-user environments. IEEE/ACM Transactions on Networking, 1:510-521.
-
(1993)
IEEE/ACM Transactions on Networking
, vol.1
, pp. 510-521
-
-
Orda, A.1
Rom, R.2
Shimkin, N.3
-
23
-
-
0038183237
-
How bad is selfish routing
-
Roughgarden, T. and Tardos, E. (2002). How bad is selfish routing. Journal of the ACM, 49(2):236-259.
-
(2002)
Journal of the ACM
, vol.49
, Issue.2
, pp. 236-259
-
-
Roughgarden, T.1
Tardos, E.2
-
24
-
-
0018671988
-
The marginal cost taxation of a transportation network
-
Smith, M. J. (1979). The marginal cost taxation of a transportation network. Transportation Research-B, 13:237-242.
-
(1979)
Transportation Research-B
, vol.13
, pp. 237-242
-
-
Smith, M.J.1
|