On the existence of pure Nash equilibria in weighted congestion games T Harks, M Klimm Mathematics of Operations Research 37 (3), 419-436, 2012 | 113 | 2012 |
On the existence of pure Nash equilibria in weighted congestion games T Harks, M Klimm Mathematics of Operations Research 37 (3), 419-436, 2012 | 113 | 2012 |
Characterizing the existence of potential functions in weighted congestion games T Harks, M Klimm, RH Möhring Theory of Computing Systems 49 (1), 46-70, 2011 | 77 | 2011 |
Characterizing the existence of potential functions in weighted congestion games T Harks, M Klimm, RH Möhring Theory of Computing Systems 49 (1), 46-70, 2011 | 77 | 2011 |
Stackelberg strategies and collusion in network games with splittable flow T Harks Theory of Computing Systems 48 (4), 781-802, 2011 | 75 | 2011 |
Stackelberg strategies and collusion in network games with splittable flow T Harks Theory of Computing Systems 48 (4), 781-802, 2011 | 75 | 2011 |
Utility proportional fair bandwidth allocation: An optimization oriented approach T Harks International Workshop on Quality of Service in Multiservice IP Networks, 61-74, 2004 | 75 | 2004 |
Stackelberg routing in arbitrary networks V Bonifaci, T Harks, G Schäfer Mathematics of Operations Research 35 (2), 330-346, 2010 | 72* | 2010 |
Approaches to congestion control in packet networks L Mamatas, T Harks, V Tsaoussidis Journal of Internet engineering 1 (1), 2007 | 63 | 2007 |
Optimal cost sharing for resource selection games P von Falkenhausen, T Harks Mathematics of Operations Research 38 (1), 184-208, 2013 | 59 | 2013 |
Strong Nash equilibria in games with the lexicographical improvement property T Harks, M Klimm, RH Möhring Internet and Network Economics: 5th International Workshop, WINE 2009, Rome …, 2009 | 52 | 2009 |
Fare evasion in transit networks J Correa, T Harks, VJC Kreuzen, J Matuschke Operations research 65 (1), 165-183, 2017 | 50 | 2017 |
Approximation algorithms for capacitated location routing T Harks, FG König, J Matuschke Transportation Science 47 (1), 3-22, 2013 | 50 | 2013 |
The worst-case efficiency of cost sharing methods in resource allocation games T Harks, K Miller Operations research 59 (6), 1491-1503, 2011 | 43 | 2011 |
The worst-case efficiency of cost sharing methods in resource allocation games T Harks, K Miller Operations research 59 (6), 1491-1503, 2011 | 43 | 2011 |
Priority pricing in utility fair networks T Harks, T Poschwatta 13TH IEEE International Conference on Network Protocols (ICNP'05), 10 pp.-320, 2005 | 37 | 2005 |
On the existence of pure Nash equilibria in weighted congestion games T Harks, M Klimm International Colloquium on Automata, Languages, and Programming, 79-89, 2010 | 36 | 2010 |
Competitive online multicommodity routing T Harks, S Heinz, ME Pfetsch Theory of Computing Systems 45 (3), 533-554, 2009 | 35* | 2009 |
Computing Network Tolls with Support Constraints T Harks, I Kleinert, M Klimm, RH Möhring Networks, 2014 | 34 | 2014 |
Strong equilibria in games with the lexicographical improvement property T Harks, M Klimm, RH Möhring International Journal of Game Theory 42, 461-482, 2013 | 34 | 2013 |