Tobias Harks
Tobias Harks
Professor of Optimization, University of Augsburg
Bestätigte E-Mail-Adresse bei math.uni-augsburg.de
Titel
Zitiert von
Zitiert von
Jahr
On the existence of pure Nash equilibria in weighted congestion games
T Harks, M Klimm
Mathematics of Operations Research 37 (3), 419-436, 2012
692012
On the existence of pure Nash equilibria in weighted congestion games
T Harks, M Klimm
Mathematics of Operations Research 37 (3), 419-436, 2012
692012
Utility proportional fair bandwidth allocation: An optimization oriented approach
T Harks
International Workshop on Quality of Service in Multiservice IP Networks, 61-74, 2004
682004
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
602011
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
602011
Approaches to congestion control in packet networks
L Mamatas, T Harks, V Tsaoussidis
Journal of Internet engineering 1 (1), 2007
592007
Stackelberg strategies and collusion in network games with splittable flow
T Harks
Theory of Computing Systems 48 (4), 781-802, 2011
532011
Stackelberg strategies and collusion in network games with splittable flow
T Harks
Theory of Computing Systems 48 (4), 781-802, 2011
532011
Stackelberg routing in arbitrary networks
V Bonifaci, T Harks, G Schäfer
Mathematics of Operations Research 35 (2), 330-346, 2010
48*2010
Strong Nash equilibria in games with the lexicographical improvement property
T Harks, M Klimm, RH Möhring
International Workshop on Internet and Network Economics, 463-470, 2009
482009
Optimal cost sharing for resource selection games
P von Falkenhausen, T Harks
Mathematics of Operations Research 38 (1), 184-208, 2013
412013
Optimal cost sharing for resource selection games
P von Falkenhausen, T Harks
Mathematics of Operations Research 38 (1), 184-208, 2013
412013
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
332010
Competitive online multicommodity routing
T Harks, S Heinz, ME Pfetsch
Theory of Computing Systems 45 (3), 533-554, 2009
33*2009
Fare evasion in transit networks
J Correa, T Harks, VJC Kreuzen, J Matuschke
Operations research 65 (1), 165-183, 2017
322017
The worst-case efficiency of cost sharing methods in resource allocation games
T Harks, K Miller
Operations research 59 (6), 1491-1503, 2011
312011
The worst-case efficiency of cost sharing methods in resource allocation games
T Harks, K Miller
Operations research 59 (6), 1491-1503, 2011
312011
Priority pricing in utility fair networks
T Harks, T Poschwatta
13TH IEEE International Conference on Network Protocols (ICNP'05), 10 pp.-320, 2005
312005
Strong equilibria in games with the lexicographical improvement property
T Harks, M Klimm, RH Möhring
International Journal of Game Theory 42 (2), 461-482, 2013
302013
Approximation algorithms for capacitated location routing
T Harks, FG König, J Matuschke
Transportation Science 47 (1), 3-22, 2013
302013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20