Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Nagurney, Anna
and
Dong, June
2001.
Paradoxes in networks with zero emission links: implications for telecommunications versus transportation.
Transportation Research Part D: Transport and Environment,
Vol. 6,
Issue. 4,
p.
283.
Roughgarden, Tim
2001.
Stackelberg scheduling strategies.
p.
104.
Mavronicolas, Marios
and
Spirakis, Paul
2001.
The price of selfish routing.
p.
510.
Roughgarden, T.
2001.
Designing networks for selfish users is hard.
p.
472.
Altman, Eitan
Azouzi, Rachid El
and
Pourtallier, Odile
2001.
Teletraffic Engineering in the Internet Era, Proceedings of the International Teletraffic Congress - ITC-I7.
Vol. 4,
Issue. ,
p.
643.
Nagurney, Anna
Dong, June
and
Mokhtarian, Patricia L.
2002.
Multicriteria network equilibrium modeling with variable weights for decision-making in the Information Age with applications to telecommuting and teleshopping.
Journal of Economic Dynamics and Control,
Vol. 26,
Issue. 9-10,
p.
1629.
HARMER, GREGORY P.
and
ABBOTT, DEREK
2002.
A REVIEW OF PARRONDO'S PARADOX.
Fluctuation and Noise Letters,
Vol. 02,
Issue. 02,
p.
R71.
Roughgarden, Tim
2002.
The price of anarchy is independent of the network topology.
p.
428.
Czumaj, Artur
Krysta, Piotr
and
Vöcking, Berthold
2002.
Selfish traffic allocation for server farms.
p.
287.
Roughgarden, Tim
and
Tardos, Éva
2002.
How bad is selfish routing?.
Journal of the ACM,
Vol. 49,
Issue. 2,
p.
236.
Altman, Eitan
Azouzi, Rachid El
and
Abramov, Vyacheslav
2002.
Non-cooperative routing in loss networks.
Performance Evaluation,
Vol. 49,
Issue. 1-4,
p.
257.
Azouzi, R.E.
Altman, E.
and
Pourtallier, O.
2002.
Properties of equilibria in competitive routing with several user types.
Vol. 4,
Issue. ,
p.
3646.
Kameda, Hisao
and
Pourtallier, Odile
2002.
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers.
Journal of the ACM,
Vol. 49,
Issue. 3,
p.
407.
Kameda, H.
2002.
How harmful the paradox can be in the Braess/Cohen-Kelly-Jeffries networks.
Vol. 1,
Issue. ,
p.
437.
Roughgarden, Tim
2003.
The price of anarchy is independent of the network topology.
Journal of Computer and System Sciences,
Vol. 67,
Issue. 2,
p.
341.
Kameda, Hisao
and
Hosokawa, Yoshihisa
2003.
ICM Millennium Lectures on Games.
p.
373.
Altman, Eitan
El Azouzi, Rachid
and
Pourtallier, Odile
2003.
Avoiding paradoxes in multi-agent competitive routing.
Computer Networks,
Vol. 43,
Issue. 2,
p.
133.
Kameda, Hisao
and
Pourtallier, Odile
2003.
Modeling and Control of Economic Systems 2001.
p.
93.
Tumer, Kagan
and
Wolpert, David
2004.
Collectives and the Design of Complex Systems.
p.
1.
Roughgarden, Tim
2004.
Stackelberg Scheduling Strategies.
SIAM Journal on Computing,
Vol. 33,
Issue. 2,
p.
332.