Variational Convergence for Functions, Studies in the Economics of Transportation, 1956. ,
Data Networks, 1992. ,
Regular Variation, 1989. ,
, über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung, vol.12, pp.258-268, 1968.
Large market games with near optimal eeciency, Proceedings of the 2016 ACM Conference on Economics and Computation, pp.791-808, 2016. ,
The asymptotic behavior of the price of anarchy, Web and Internet Economics, pp.133-145, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01643345
On the price of anarchy of highly congested nonatomic network games, Algorithmic Game Theory, pp.117-128, 2016. ,
Sellsh routing in capacitated networks, Math. Oper. Res, vol.29, issue.4, pp.961-976, 2004. ,
Fast, fair, and eecient ows in networks, Oper. Res, vol.55, issue.2, pp.215-225, 2007. ,
A geometric approach to the price of anarchy in nonatomic congestion games, Games Econom. Behav, vol.64, issue.2, pp.457-469, 2008. ,
Extreme Value Theory, 2006. ,
Price of anarchy for polynomial Wardrop games, WINE '06: Proceedings of the 2nd Conference on Web and Internet Economics, pp.319-330, 2006. ,
The price of anarchy in large games, STOC'16-Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, pp.963-976, 2016. ,
On the price of being sellsh in large populations of plug-in electric vehicles, CDC '15: Proceedings of the 53rd IEEE Annual Conference on Decision and Control, pp.6542-6547, 2015. ,
Regularly varying functions, Publ. Inst. Math, vol.80, issue.94, pp.171-192, 2006. ,
DOI : 10.2298/pim0694171j
URL : http://www.actuar.aegean.gr/samos2006/abstracts/jessen_2.pdf
Sur un mode de croissance régulière des fonctions, Mathematica (Cluj), vol.4, pp.38-53, 1930. ,
Sur un mode de croissance régulière, Théorèmes fondamentaux. Bull. Soc. Math. France, vol.61, pp.55-62, 1933. ,
DOI : 10.24033/bsmf.1196
URL : http://www.numdam.org/article/BSMF_1933__61__55_0.pdf
Worst-case equilibria, STACS '99: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 1999. ,
DOI : 10.1007/3-540-49116-3_38
An eecient approach to solving the road network equilibrium traac assignment problem, Transportation Research, vol.9, pp.309-318, 1975. ,
How bad is sellsh routing in practice, 2017. ,
Mechanisms that govern how the price of anarchy varies with travel demand, Transportation Research Part B: Methodological, vol.84, pp.55-80, 2016. ,
Algorithms, games, and the Internet, STOC '01: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, 2001. ,
DOI : 10.1007/3-540-48224-5_1
URL : http://www.cs.berkeley.edu/~christos/games/readings/stoc.ps
The Economics of Welfare, 1920. ,
Heavy-Tail Phenomena, 2007. ,
The price of anarchy is independent of the network topology, J. Comput. System Sci, vol.67, issue.2, pp.341-364, 2003. ,
Routing games, Algorithmic Game Theory, pp.461-486, 2007. ,
DOI : 10.1017/cbo9780511800481.020
Bounding the ineeciency of equilibria in nonatomic congestion games, Games Econom. Behav, vol.47, issue.2, pp.389-403, 2004. ,
The price of anarchy for a network of queues in heavy traac, Essays in Production, Project Planning and Scheduling: A Festschrift in Honor of Salah Elmaghraby, pp.91-121, 2014. ,
Some theoretical aspects of road traac research, Proceedings of the Institute of Civil Engineers, Part II, vol.1, pp.325-378, 1952. ,
Sellshness need not be bad, 2017. ,
Price of anarchy in transportation networks: EEciency and optimality control, Physical Review Letters, vol.101, issue.12, p.128701, 2008. ,