Atomic routing in a deterministic queuing model

Rosenthal, 1973, A class of games possessing a pure-strategy nash equilibrium, Internat J Game Theory, 2, 65, 10.1007/BF01737559 Roughgarden, 2002, How bad is selfish routing?, J ACM, 49, 236, 10.1145/506147.506153 Nash, 1950, Equilibrium points in n-person games, Proc Natl Acad Sci, 36, 48, 10.1073/pnas.36.1.48 Aumann, 1959, Acceptable points in general cooperative n-person games, vol. 40, 287 Pigou, 1920 Koutsoupias, 1999, Worst-case equilibria, vol. 1563, 404 Papadimitriou, 2001, Algorithms, games, and the Internet, 749 Roughgarden, 2007, Selfish routing and the price of anarchy, OPTIMA, 74 Skutella, 2009, An introduction to network flows over time, 451 Köhler, 2009, Traffic networks and flows over time, 166 Koch, 2011, Nash equilibria and the price of anarchy for flows over time, Theory Comput Syst, 49, 71, 10.1007/s00224-010-9299-y Banner, 2007, Bottleneck routing games in communication networks, IEEE J Sel Areas Commun, 25, 1173, 10.1109/JSAC.2007.070811 European Union. Council Regulation (EC) No 1/2005 of 22 December 2004 on the protection of animals during transport and related operations and amending Directives 64/432/EEC and 93/119/EC and Regulation (EC) No 1255/97. Hill, 2001, Optical switching networks: from circuits to packets, Commun Mag, 39, 107, 10.1109/MCOM.2001.910597 Dorren, 2003, Optical packet switching and buffering by using all-optical signal processing methods, J Lightwave Technol, 21, 2, 10.1109/JLT.2002.803062 Baert, 2004, Routing strategies to minimize packet loss in an optical packet switched network with recirculating fdl buffers, Photonic Netw Commun, 7, 279, 10.1023/B:PNET.0000026892.02534.ad Mukherjee, 2006 Anshelevich, 2009, Equilibria in dynamic selfish routing, vol. 5814, 171 Farzad, 2008, A priority-based model of routing, J Theor Comput Sci, 1, 1, 10.4086/toc.gs.2008.001 Hoefer, 2011, Competitive routing over time, Theoret Comput Sci, 412, 5420, 10.1016/j.tcs.2011.05.055 Harks, 2013, Strong equilibria in games with the lexicographical improvement property, Internat J Game Theory, 42, 461, 10.1007/s00182-012-0322-1 Sperber, 2009 Caragiannis, 2005, Network load games, vol. 3827, 809 Harks, 2013, Computing pure nash and strong equilibria in Bottleneck congestion games, Math Program Ser A, 141, 193, 10.1007/s10107-012-0521-3 Fotakis, 2009, The structure and complexity of nash equilibria for a selfish routing game, Theoret Comput Sci, 410, 3305, 10.1016/j.tcs.2008.01.004 Correa, 2007, Fast, fair and efficient flows in networks, Oper Res, 55, 215, 10.1287/opre.1070.0383 Busch, 2009, Atomic routing games on maximum congestion, Theoret Comput Sci, 410, 3337, 10.1016/j.tcs.2009.04.015 Werth, 2013, Computation of equilibria and the price of anarchy in Bottleneck congestion games, CEJOR Cent Eur J Oper Res Even S., Itai A., Shamir A. On the complexity of time table and multi-commodity flow problems. In: 16th annual symposium on foundations of computer science. 1975, pp. 691–703. Garey, 1979 Fotakis, 2005, Symmetry in network congestion games: pure equilibria and anarchy cost, 161 Ford, 1962 Ahuja, 1993 Schrijver, 2003 Nemhauser, 1999