Follow
Tobias Harks
Tobias Harks
Professor of Mathematical Optimization, University of Passau
Verified email at uni-passau.de - Homepage
Title
Cited by
Cited by
Year
On the existence of pure Nash equilibria in weighted congestion games
T Harks, M Klimm
Mathematics of Operations Research 37 (3), 419-436, 2012
1142012
On the existence of pure Nash equilibria in weighted congestion games
T Harks, M Klimm
Mathematics of Operations Research 37 (3), 419-436, 2012
1142012
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
782011
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
782011
Utility proportional fair bandwidth allocation: An optimization oriented approach
T Harks
International Workshop on Quality of Service in Multiservice IP Networks, 61-74, 2004
752004
Stackelberg strategies and collusion in network games with splittable flow
T Harks
Theory of Computing Systems 48 (4), 781-802, 2011
742011
Stackelberg strategies and collusion in network games with splittable flow
T Harks
Theory of Computing Systems 48 (4), 781-802, 2011
742011
Stackelberg routing in arbitrary networks
V Bonifaci, T Harks, G Schäfer
Mathematics of Operations Research 35 (2), 330-346, 2010
73*2010
Approaches to congestion control in packet networks
L Mamatas, T Harks, V Tsaoussidis
Journal of Internet engineering 1 (1), 2007
632007
Optimal cost sharing for resource selection games
P von Falkenhausen, T Harks
Mathematics of Operations Research 38 (1), 184-208, 2013
592013
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
552009
Fare evasion in transit networks
J Correa, T Harks, VJC Kreuzen, J Matuschke
Operations research 65 (1), 165-183, 2017
522017
Approximation algorithms for capacitated location routing
T Harks, FG König, J Matuschke
Transportation Science 47 (1), 3-22, 2013
522013
The worst-case efficiency of cost sharing methods in resource allocation games
T Harks, K Miller
Operations research 59 (6), 1491-1503, 2011
432011
The worst-case efficiency of cost sharing methods in resource allocation games
T Harks, K Miller
Operations research 59 (6), 1491-1503, 2011
432011
Computing Network Tolls with Support Constraints
T Harks, I Kleinert, M Klimm, RH Möhring
Networks, 2014
382014
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
372010
Priority pricing in utility fair networks
T Harks, T Poschwatta
13TH IEEE International Conference on Network Protocols (ICNP'05), 10 pp.-320, 2005
372005
Competitive online multicommodity routing
T Harks, S Heinz, ME Pfetsch
Theory of Computing Systems 45 (3), 533-554, 2009
36*2009
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
342013
The system can't perform the operation now. Try again later.
Articles 1–20