Articles with public access mandates - Tobias HarksLearn more
Available somewhere: 33
On the existence of pure Nash equilibria in weighted congestion games
T Harks, M Klimm
Mathematics of Operations Research 37 (3), 419-436, 2012
Mandates: German Research Foundation
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
Mandates: German Research Foundation
Optimal cost sharing for resource selection games
P von Falkenhausen, T Harks
Mathematics of Operations Research 38 (1), 184-208, 2013
Mandates: German Research Foundation
Computing Network Tolls with Support Constraints
T Harks, I Kleinert, M Klimm, RH Möhring
Networks, 2014
Mandates: German Research Foundation
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
Mandates: German Research Foundation
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
Mandates: German Research Foundation
Competitive online multicommodity routing
T Harks, S Heinz, ME Pfetsch
Theory of Computing Systems 45 (3), 533-554, 2009
Mandates: German Research Foundation
Dynamic flows with adaptive route choice
L Graf, T Harks, L Sering
Mathematical Programming 183, 309-335, 2020
Mandates: German Research Foundation
Sensitivity analysis for convex separable optimization over integral polymatroids
T Harks, M Klimm, B Peis
SIAM Journal on Optimization 28 (3), 2222-2245, 2018
Mandates: German Research Foundation, European Commission
Complexity and approximation of the continuous network design problem
M Gairing, T Harks, M Klimm
SIAM Journal on Optimization 27 (3), 1554-1582, 2017
Mandates: UK Engineering and Physical Sciences Research Council
Optimal cost sharing for capacitated facility location games
T Harks, P von Falkenhausen
European Journal of Operational Research 239 (1), 187-198, 2014
Mandates: German Research Foundation, European Commission
Congestion games with variable demands
T Harks, M Klimm
Proceedings of the 13th conference on theoretical aspects of rationality and …, 2011
Mandates: German Research Foundation
iREX: Efficient automation architecture for the deployment of inter-domain QoS policy
AD Yahaya, T Harks, T Suda
IEEE Transactions on Network and Service Management 5 (1), 50-64, 2008
Mandates: German Research Foundation
Constrained resource assignments: Fast algorithms and applications in wireless networks
A Berger, J Gross, T Harks, S Tenbusch
Management Science 62 (7), 2070-2089, 2016
Mandates: German Research Foundation, European Commission
Generalized Nash equilibrium problems with mixed-integer variables
T Harks, J Schwarz
Mathematical Programming, 1-47, 2024
Mandates: German Research Foundation
The price of anarchy for instantaneous dynamic equilibria
L Graf, T Harks
Mathematics of Operations Research 48 (4), 2167-2195, 2023
Mandates: German Research Foundation
Routing games with progressive filling
T Harks, M Hoefer, K Schewior, A Skopalik
IEEE/ACM transactions on networking 24 (4), 2553-2562, 2015
Mandates: German Research Foundation, European Commission
Optimal file distribution in peer-to-peer networks
KS Goetzmann, T Harks, M Klimm, K Miller
International Symposium on Algorithms and Computation, 210-219, 2011
Mandates: German Research Foundation
Online multicommodity routing with time windows
T Harks, S Heinz, M Pfetsch, T Vredeveld
Mandates: German Research Foundation
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
L Graf, T Harks
Mathematical Programming 197 (2), 761-792, 2023
Mandates: German Research Foundation
Publication and funding information is determined automatically by a computer program