Publications (Prof. Harks)

 

 

 

 

edited Books and Special Issues

 

 

 

 

Working Papers

  • Dynamic Traffic Assignment for Electric Vehicles [ pdf]
    (with Lukas Graf and Prashant Palkar)
  • Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment [ pdf]
    (with Lukas Graf, Kostas Kollias and Michael Markl)
    To appear at 36th AAAI Conference on Artificial Intelligence 2022

  • Multi-Leader Congestion Games with an Adversary [ pdf]
    (with Mona Henle, Max Klimm, Jannik Matuschke and Anja Schedel)
    To appear at 36th AAAI Conference on Artificial Intelligence 2022
  • Generalized Nash Equilibrium Problems with Mixed-Integer Variables [ pdf]
    (with Julian Schwarz)
    To appear at WINE 2021
  • The Price of Anarchy for Instantaneous Dynamic Equilibria [ pdf]
    (with Lukas Graf)
    WINE 2020
  • Pricing in Resource Allocation Games Based on Lagrangean Duality and Convexification [ pdf]
  • Online Routing with Time Windows [ pdf ]
    (with S. Heinz, M. Pfetsch and T. Vredeveld)
    ZIB Working Paper, August 2007
  • The Impact of Collusion on the Price of Anarchy in Nonatomic and Discrete Network Games [pdf]
    Optimization Online, January 2007

 

 

 

 

Journal Articles

  • A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows [ pdf]
    (with Lukas Graf) 
    Mathematical Programming, to appear
    Preliminary version: Proc. of the 19th IPCO 2021
  • Stackelberg Pricing Games with Congestion Effects [ pdf]
    (with Anja Schedel)
    Mathematical Programming, to appear
    Preliminary version: Proc. of the 15th WINE 2019
  • Equilibrium Computation in Resource Allocation Games (+Corrigendum) [ pdf]
    (with V. Tan-Timmermans)
    Mathematical Programming, 194, pp.1-34 (2022) 
    Preliminary version: Proc. of the 19th IPCO 2017
  • Pure Nash Equilibria in Resource Graph Games [ pdf]
    (with Max Klimm and Jannik Matuschke) 
    Journal of Artificial Intelligence Research, 72 (1), pp. 185-213 (2021)

  • Efficient Black-Box Reductions for Separable Cost Sharing [ pdf]
    (with M. Hoefer, A. Huber and M. Surek)
    Mathematics of Operations Research, 46 (1), pp. 134-158 (2021)
    Preliminary version: Proc. of the 45th ICALP 2018
  • Dynamic Flows with Adaptive Route Choice [ pdf]
    (with L. Graf and L. Sering)
    Mathematical Programming, 183, pp. 309–335 (2020) 
    Preliminary version: Proc. of the 20th IPCO 2019
  • Broadcasting a File in a Communication Network [ link]
    (with K.S Goetzmann and M. Klimm)
    Journal of Scheduling, 23, pp. 211–232 (2020)
  • A Characterization of Undirected Graphs Admitting Optimal Cost Shares [pdf]
    (with A. Huber and M. Surek)
    SIAM Journal on Discrete Mathematics, 33 (4), pp. 1932–1996 (2019)
    Preliminary version: Proc. of the 13th WINE 2017
  • Toll Caps in Privatized Road Networks [pdf]
    (with M. Schroder and D. Vermeulen)
    European Journal of Operational Research 276 (3) pp. 947-956 (2019)
  • Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids [ pdf]
    (with M. Klimm and B. Peis)
    SIAM Journal on Optimization 28 (3) pp. 2222-2245 (2018)
  • Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games [pdf]
    (with V. Timmermans)
    Journal of Combinatorial Optimization 36(3) pp. 812-830 (2018)
    Preliminary version: In Proc. of the 4th ISCO 2016
  • Competitive Packet Routing with Priority Lists [ pdf]
    (with B. Peis, D. Schmand, B. Tauer and L. Vargas-Koch)
    ACM Transactions on Economics and Computation 6 (1) pp. 4:1-4:26 (2018)
    Preliminary version: In Proc. of MFCS 2016
  • Bottleneck Routing with Elastic Demands [ pdf]
    (with M. Klimm and M. Schneider)
    Operations Research Letters 46 (1), pp. 93-98 (2018)
    Preliminary version: Proc. of the 11th WINE 2015
  • Complexity and Approximation of the Continuous Network Design Problem [ pdf ]
    (with M. Gairing and M. Klimm)
    SIAM Journal on Optimization 27(3), pp. 1554-1582 (2017)
    Preliminary version: In Proc. of 17th. APPROX-RANDOM 2014.
  • Matroids are Immune to Braess Paradox [ pdf]
    (with S. Fujishige, M.X. Goemans, B. Peis and R. Zenklusen)
    Mathematics of Operations Research 42(3), pp. 745–761 (2017)
  • Fare Evasion in Transit Networks [ pdf]
    (with J. R. Correa, V. Kreuzen and J. Matuschke)
    Operations Research 65(1), pp. 165-183 (2017)
  • Robust Quantitative Comparative Statics for a Multimarket Paradox [ pdf]
    (with P. von Falkenhausen)
    ACM Transactions on Economics and Computation 5(1), pp. 3:1-3:22 (2016)
    Preliminary version: In Proc. of 9th WINE 2013
  • A Logarithmic Approximation for Polymatroid Congestion Games [ pdf]
    (with T. Oosterwijk and T. Vredeveld)
    Operations Research Letters 44(6), pp. 712-717 (2016)
  • Routing Games with Progressive Filling [pdf]
    (with M. Hoefer, K. Schewior, A. Skopalik)
    IEEE/ACM Transactions on Networking 24(4), pp. 2553-2562 (2016)
    Preliminary version: In Proc. of the 33rd IEEE INFOCOM 2014.
  • Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks [ pdf]
    (with A. Berger, J. Gross and S. Tenbusch)
    Management Science, 62(7) pp. 2070-2089 (2016)
    Preliminary version: In Proc. of the 29th IEEE INFOCOM 2010 [pdf]
  • An Integrated Approach to Tactical Transportation Planning in Logistics Networks [pdf]
    (with F. G. König, J. Matuschke, A. Richter and J. Schulz)
    Transportation Science 50(2), pp. 439–460 (2016)
  • Congestion Games with Variable Demands [ pdf]
    (with M. Klimm)
    Mathematics of Operations Research 41(1), pp. 255–277 (2016)
    Preliminary version: In Proceedings of TARK 2011 [pdf]
  • Equilibria in a Class of Aggregative Location Games [ pdf]
    (with M. Klimm)
    Journal of Mathematical Economics 61(1), pp. 211-220 (2015)
  • Congestion Games Viewed from M-convexity [pdf]
    (with S. Fujishige, M.X. Goemans, B. Peis and R. Zenklusen)
    Operations Research Letters 43, pp. 329-333 (2015)
  • Computing Network Tolls with Support Contraints [pdf]
    (with M. Klimm, I. Kleinert and R.H. Möhring)
    Networks 65(3), pp. 262-285 (2015)
  • Resource Buying Games [pdf]
    (with B. Peis)
    Algorithmica 70(3), pp 493-512 (2014)
    Preliminary version: ESA 2012, LNCS 7501, pp. 563-574
  • Optimal Cost Sharing for Capacitated Facility Location Games  [pdf]
    (with P. von Falkenhausen)
    European Journal of Operational Research 239(1), pp. 187-198 (2014)
  • Computing Pure and Strong Nash Equilibria in Bottleneck Congestion Games [pdf]
    (with M. Hoefer, M. Klimm and A. Skopalik)
    Mathematical Programming (Ser. A), 141(1), pp. 193-215 (2013)
    Preliminary version: ESA, 2010, 29-38, 2010
  • Strong Equilibria in Games with the Lexicographical Improvement Property [pdf]
    (with M. Klimm and R.H. Möhring)
    International Journal of Game Theory, 42(2), pp. 461-482 (2013)
    Preliminary version: WINE, LNCS 5929, Springer, pp. 455--462, 2009
  • Optimal Cost Sharing for Resource Selection Games [pdf]
    (with P. von Falkenhausen)
    Mathematics of Operations Research 38(1), pp. 184-204 (2013)
  • Approximation Algorithms for Capacitated Location Routing [pdf]
    (with F.G. König and J. Matuschke)
    Transportation Science 47(1), pp. 3-22 (2013)
  • On the Existence of Pure Nash Equilibria in Weighted Congestion Games [pdf]
    (with M. Klimm)
    Mathematics of Operations Research 37(3), pp. 419-436 (2012)
    Preliminary version: ICALP, LNCS 6198, pp. 79-89, 2010
  • The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games [pdf][e-companion]
    (with K. Miller)
    Operations Research, 56(6), pp. 1491-1503 (2011)
    Preliminary version: GameNets, 2009, pp. 393-402
  • Characterizing the Existence of Potential Functions in Weighted Congestion Games [pdf]
    (with M. Klimm and R.H. Möhring)
    Theory of Computing Systems, 49(1), pp. 46-70 (2011)
    Preliminary version: SAGT, 2009, LNCS 5814, pp. 97-108
  • Stackelberg Strategies and Collusion in Network Games with Splittable Flow [pdf]
    Theory of Computing Systems, 48(4), pp. 781-802 (2011)
    Preliminary version: WAOA, 2008, LNCS 5426, pp.133-146
  • Stackelberg Routing in Arbitrary Networks [pdf]
    (with V. Bonifaci and G. Schäfer)
    Mathematics of Operations Research, 35(2), pp. 330-346 (2010)
    Preliminary version: WINE, 2008, LNCS 5385, pp.239-250
  • Competitive Online Multicommodity Routing [pdf]
    (with S. Heinz and M. Pfetsch)
    Theory of Computing Systems 45(3), pp. 533-554 (2009)
    Preliminary version: WAOA 2006, Springer LNCS, Vol. 4368
  • Congestion Control in Utility Fair Networks [pdf]
    (with T. Poschwatta)
    Computer Networks 52, pp.2947-2960 (2008)
    Preliminary version: QoS-IP 2005, ICNP 2005, Gobal Internet 2006
  • iREX: Efficient automation architecture for the deployment of inter-domain QoS policy [pdf]
    (with A. Yahaya and T. Suda)
    IEEE Transactions on Network and Service Management (TNSM) 5(1), pp.50-64 (2008)
    Preliminary version: IEEE Globecom, 2006, San Francisco, USA
  • Approaches to Congestion Control in Packet Networks  [pdf]
    (with L. Mamatas and V. Tsaoussidis)
    Journal of Internet Engineering (JIE) 1(1) (2007)

 

 

 

 

Articles in Refereed Conference Proceedings

  • Capacity and Price Competition in Markets with Congestion Effects [ pdf]
    (with A. Schedel)
    In Proc. of the 15th Conference on Web and Internet Economics (WINE 2019)

  • Resource Competition on Integral Polymatroids [pdf]
    (with M. Klimm and B. Peis)
    In Proceedings of the 10th Conference on Internet and Network Economics (WINE 2014)
  • Multimarket Oligopolies with Restricted Market Access [pdf]
    (with M. Klimm)
    In 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, to appear
  • Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces [pdf]
    (with M. Klimm)
    In Proceedings of the 7th Workshop on Internet and Network Economics (WINE 2011), LNCS 7090, pp. 194-205
  • Optimal File Distribution in Peer-to-Peer Networks [pdf]
    (with K.S. Götzman, M. Klimm, K. Miller)
    In Proceedings of the 22nd International Symposium on Algorithm and Computation (ISAAC), LNCS 7074, pp. 210-219
  • Optimal Cost Sharing Protocols for Scheduling Games [pdf]
    (with P. von Falkenhausen)
    In Proceedings of the The 12th ACM Conf. on Electronic Commerce (EC 2011)
  • Utility Max-Min Fair Congestion Control With Time-Varying Delays [pdf]
    (with K. Miller)
    In Proc. of the 27th IEEE Conference on Computer Communications (INFOCOM), Phoenix, AZ, USA, April 2008.
  • Nonadaptive Selfish Routing with Online Demands [pdf]
    (with L. Vegh)
    In Proceedings of Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007), Springer LNCS, Vol. 4852, pp.27-45.
  • On User Strategies in Networks Implementing Congestion Pricing [pdf]
    (with T. Poschwatta)
    In Proceedings of the IEEE CCNC, 2006, Las Vegas, USA.
  • Priority Pricing in Utility Fair Networks [pdf]
    (with T. Poschwatta)
    In Proceedings of the 13th IEEE Inter. Conf. on Network Protocols (ICNP), 2005, Boston, USA.
  • Utility Fair Congestion Control for Real-Time Traffic [pdf]
    (with T. Poschwatta)
    In Proceedings of the 8th IEEE Global Internet Symposium/IEEE Infocom, 2005, Miami, USA.
  • Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach [pdf]
    In Proceedings of QoS in Multiservice IP Networks, 2005, Springer LNCS, Vol. 3375, pp. 61-74, Catania, Italy.

 

 

 

 

Theses

  • Theoretical and Computational Aspects of Resource Allocation Problems. [pdf]
    Habilitation, Technical University Berlin, Berlin, Germany, 2012
  • Multicommodity Routing Problems - Selfish Behavior and Online Aspects. [pdf]
    PhD thesis, Technical University Berlin, Berlin, Germany, 2007
  • Berechnung optimaler Angebotskurven in Elektrizitätsmärkten mit Methoden optimaler Steuerprozesse, Constructing Optimal Supply Curves in Electricity Markets Using Optimal Control [pdf]
    Diploma thesis, Fachbereich Mathematik, Universität Muenster, Germany, 2003

Suche