Tobias Harks

137 papers A* 13A 1B 13C 4Journal 86Unranked 17
YearRankTypeTitle / Venue / Authors
2026 — ed.
Game Theory for Networks - 13th EAI International Conference, GameNets 2025, Cambridge, UK, March 17-18, 2025, Proceedings
GAMENETS
Vaneet Aggarwal, Tobias Harks, Sanjiv Kapoor
2025 A* conf
Are System Optimal Dynamic Flows Implementable by Tolls?
EC
Julian Schwarz, Tobias Harks, Lukas Graf
2025 J jnl
Are System Optimal Dynamic Flows Implementable by Tolls?
CoRR
Lukas Graf, Tobias Harks, Julian Schwarz
2025 J jnl
Branch-and-Cut for Computing Approximate Equilibria of Mixed-Integer Generalized Nash Games.
CoRR
Aloïs Duguet, Tobias Harks, Martin Schmidt, Julian Schwarz
2025 J jnl
Branch-and-Cut for Mixed-Integer Generalized Nash Equilibrium Problems.
CoRR
Aloïs Duguet, Tobias Harks, Martin Schmidt, Julian Schwarz
2025 J jnl
Carbon Pricing in Traffic Networks.
CoRR
Svenja M. Griesbach, Tobias Harks, Max Klimm, Michael Markl, Philipp Warode
2025 J jnl
Generalized Nash equilibrium problems with mixed-integer variables.
Math. Program.
Tobias Harks, Julian Schwarz
2025 J jnl
Minimal Regret Walras Equilibria for Combinatorial Markets.
CoRR
Aloïs Duguet, Tobias Harks, Martin Schmidt, Julian Schwarz
2025 J jnl
Multi-Leader Congestion Games with an Adversary.
J. Artif. Intell. Res.
Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2025 A* conf
Tolls for Dynamic Equilibrium Flows.
SODA
Lukas Graf, Tobias Harks, Julian Schwarz
2024 J jnl
A Decomposition Theorem for Dynamic Flows.
CoRR
Lukas Graf, Tobias Harks, Julian Schwarz
2024 C conf
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities.
ATMOS
Tobias Harks, Sven Jäger, Michael Markl, Philine Schiewe
2024 J jnl
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities.
CoRR
Tobias Harks, Sven Jäger, Michael Markl, Philine Schiewe
2024 A* conf
Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources.
SODA
José Correa, Tobias Harks, Anja Schedel, José Verschae
2024 J jnl
Side-Constrained Dynamic Traffic Equilibria.
Oper. Res.
Lukas Graf, Tobias Harks
2024 J jnl
Stackelberg pricing games with congestion effects.
Math. Program.
Tobias Harks, Anja Schedel
2024 J jnl
Stochastic Prediction Equilibrium for Dynamic Traffic Assignment.
CoRR
Lukas Graf, Tobias Harks, Michael Markl
2023 J jnl
A Unified Framework for Pricing in Nonconvex Resource Allocation Games.
SIAM J. Optim.
Tobias Harks, Julian Schwarz
2023 J jnl
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows.
Math. Program.
Lukas Graf, Tobias Harks
2023 J jnl
Prediction Equilibrium for Dynamic Network Flows.
J. Mach. Learn. Res.
Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl
2023 A* conf
Side-Constrained Dynamic Traffic Equilibria.
EC
Lukas Graf, Tobias Harks
2023 J jnl
The Price of Anarchy for Instantaneous Dynamic Equilibria.
Math. Oper. Res.
Lukas Graf, Tobias Harks
2022 J jnl
Correction to: Broadcasting a file in a communication network.
J. Sched.
Kai-Simon Goetzmann, Tobias Harks, Max Klimm
2022 J jnl
Correction to: Equilibrium computation in resource allocation games.
Math. Program.
Tobias Harks, Veerle Timmermans
2022 C conf
Dynamic Traffic Assignment for Electric Vehicles.
ATMOS
Lukas Graf, Tobias Harks, Prashant Palkar
2022 J jnl
Dynamic Traffic Assignment for Electric Vehicles.
CoRR
Lukas Graf, Tobias Harks, Prashant Palkar
2022 J jnl
Equilibrium computation in resource allocation games.
Math. Program.
Tobias Harks, Veerle Timmermans
2022 A* conf
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment.
AAAI
Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl
2022 A* conf
Multi-Leader Congestion Games with an Adversary.
AAAI
Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2022 J jnl
Side-Constrained Dynamic Traffic Equilibria.
CoRR
Lukas Graf, Tobias Harks
2021 B conf
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows.
IPCO
Lukas Graf, Tobias Harks
2021 J jnl
Efficient Black-Box Reductions for Separable Cost Sharing.
Math. Oper. Res.
Tobias Harks, Martin Hoefer, Anja Schedel, Manuel Surek
2021 — conf
Generalized Nash Equilibrium Problems with Mixed-Integer Variables.
WINE
Tobias Harks, Julian Schwarz
2021 J jnl
Generalized Nash Equilibrium Problems with Mixed-Integer Variables.
CoRR
Tobias Harks, Julian Schwarz
2021 J jnl
Introduction to the Special Issue on WINE'18: Part 1.
ACM Trans. Economics and Comput.
Giorgos Christodoulou, Tobias Harks
2021 J jnl
Introduction to the Special Issue on WINE'18: Part 2.
ACM Trans. Economics and Comput.
Giorgos Christodoulou, Tobias Harks
2021 J jnl
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment.
CoRR
Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl
2021 J jnl
Multi-Leader Congestion Games with an Adversary.
CoRR
Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2021 J jnl
Pure Nash Equilibria in Resource Graph Games.
J. Artif. Intell. Res.
Tobias Harks, Max Klimm, Jannik Matuschke
2020 J jnl
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows.
CoRR
Lukas Graf, Tobias Harks
2020 B ed.
Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Augsburg, Germany, September 16-18, 2020, Proceedings
SAGT
Tobias Harks, Max Klimm
2020 J jnl
Broadcasting a file in a communication network.
J. Sched.
Kai-Simon Goetzmann, Tobias Harks, Max Klimm
2020 J jnl
Dynamic flows with adaptive route choice.
Math. Program.
Lukas Graf, Tobias Harks, Leon Sering
2020 J jnl
Pure Nash Equilibria in Resource Graph Games.
CoRR
Tobias Harks, Max Klimm, Jannik Matuschke
2020 — conf
The Price of Anarchy for Instantaneous Dynamic Equilibria.
WINE
Lukas Graf, Tobias Harks
2020 J jnl
The Price of Anarchy for Instantaneous Dynamic Equilibria.
CoRR
Lukas Graf, Tobias Harks
2019 J jnl
A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
SIAM J. Discret. Math.
Tobias Harks, Anja Schedel, Manuel Surek
2019 — conf
Capacity and Price Competition in Markets with Congestion Effects.
WINE
Tobias Harks, Anja Schedel
2019 J jnl
Capacity and Price Competition in Markets with Congestion Effects.
CoRR
Tobias Harks, Anja Schedel
2019 B conf
Dynamic Flows with Adaptive Route Choice.
IPCO
Lukas Graf, Tobias Harks
2019 J jnl
Pricing in Resource Allocation Games Based on Duality Gaps.
CoRR
Tobias Harks
2019 J jnl
Toll caps in privatized road networks.
Eur. J. Oper. Res.
Tobias Harks, Marc Schröder, Dries Vermeulen
2018 J jnl
Bottleneck routing with elastic demands.
Oper. Res. Lett.
Tobias Harks, Max Klimm, Manuel Schneider
2018 J jnl
Competitive Packet Routing with Priority Lists.
ACM Trans. Economics and Comput.
Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch
2018 J jnl
Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs.
CoRR
Tobias Harks, Veerle Timmermans
2018 J jnl
Dynamic Flows with Adaptive Route Choice.
CoRR
Lukas Graf, Tobias Harks
2018 J jnl
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102).
Dagstuhl Reports
Roberto Cominetti, Tobias Harks, Carolina Osorio, Britta Peis
2018 A* conf
Efficient Black-Box Reductions for Separable Cost Sharing.
ICALP
Tobias Harks, Martin Hoefer, Anja Huber, Manuel Surek
2018 J jnl
Efficient Black-Box Reductions for Separable Cost Sharing.
CoRR
Tobias Harks, Martin Hoefer, Anja Huber, Manuel Surek
2018 J jnl
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids.
SIAM J. Optim.
Tobias Harks, Max Klimm, Britta Peis
2018 J jnl
Toll Caps in Privatized Road Networks.
CoRR
Tobias Harks, Marc Schröder, Dries Vermeulen
2018 J jnl
Uniqueness of equilibria in atomic splittable polymatroid congestion games.
J. Comb. Optim.
Tobias Harks, Veerle Timmermans
2018 — ed.
Web and Internet Economics - 14th International Conference, WINE 2018, Oxford, UK, December 15-17, 2018, Proceedings
WINE
George Christodoulou, Tobias Harks
2017 — conf
A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
WINE
Tobias Harks, Anja Huber, Manuel Surek
2017 J jnl
A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
CoRR
Tobias Harks, Anja Huber, Manuel Surek
2017 J jnl
Complexity and Approximation of the Continuous Network Design Problem.
SIAM J. Optim.
Martin Gairing, Tobias Harks, Max Klimm
2017 B conf
Equilibrium Computation in Atomic Splittable Singleton Congestion Games.
IPCO
Tobias Harks, Veerle Timmermans
2017 J jnl
Fare Evasion in Transit Networks.
Oper. Res.
José Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke
2017 J jnl
Matroids Are Immune to Braess' Paradox.
Math. Oper. Res.
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2016 J jnl
A logarithmic approximation for polymatroid congestion games.
Oper. Res. Lett.
Tobias Harks, Tim Oosterwijk, Tjark Vredeveld
2016 J jnl
An Integrated Approach to Tactical Transportation Planning in Logistics Networks.
Transp. Sci.
Tobias Harks, Felix G. König, Jannik Matuschke, Alexander T. Richter, Jens Schulz
2016 B conf
Competitive Packet Routing with Priority Lists.
MFCS
Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch
2016 J jnl
Congestion Games with Variable Demands.
Math. Oper. Res.
Tobias Harks, Max Klimm
2016 J jnl
Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks.
Manag. Sci.
André Berger, James Gross, Tobias Harks, Simon Tenbusch
2016 J jnl
Equilibrium Computation in Atomic Splittable Singleton Congestion Games.
CoRR
Veerle Timmermans, Tobias Harks
2016 J jnl
Robust Quantitative Comparative Statics for a Multimarket Paradox.
ACM Trans. Economics and Comput.
Tobias Harks, Philipp von Falkenhausen
2016 J jnl
Routing Games With Progressive Filling.
IEEE/ACM Trans. Netw.
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
2016 J jnl
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids.
CoRR
Tobias Harks, Max Klimm, Britta Peis
2016 C conf
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games.
ISCO
Tobias Harks, Veerle Timmermans
2015 — conf
Bottleneck Routing with Elastic Demands.
WINE
Tobias Harks, Max Klimm, Manuel Schneider
2015 J jnl
Computing network tolls with support constraints.
Networks
Tobias Harks, Ingo Kleinert, Max Klimm, Rolf H. Möhring
2015 J jnl
Congestion games viewed from M-convexity.
Oper. Res. Lett.
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2015 J jnl
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412).
Dagstuhl Reports
José R. Correa, Tobias Harks, Kai Nagel, Britta Peis, Martin Skutella
2015 J jnl
Matroids are Immune to Braess Paradox.
CoRR
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2015 J jnl
Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking.
Theory Comput. Syst.
Dimitris Fotakis, Tobias Harks
2015 — ch.
Resource Buying Games.
Gems of Combinatorial Optimization and Graph Algorithms
Tobias Harks, Britta Peis
2015 J jnl
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games.
CoRR
Tobias Harks, Veerle Timmermans
2014 — conf
Complexity and Approximation of the Continuous Network Design Problem.
APPROX-RANDOM
Martin Gairing, Tobias Harks, Max Klimm
2014 J jnl
Fare Evasion in Transit Networks.
CoRR
José R. Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke
2014 B conf
Multimarket Oligopolies with Restricted Market Access.
SAGT
Tobias Harks, Max Klimm
2014 J jnl
Optimal cost sharing for capacitated facility location games.
Eur. J. Oper. Res.
Tobias Harks, Philipp von Falkenhausen
2014 J jnl
Resource Buying Games.
Algorithmica
Tobias Harks, Britta Peis
2014 — conf
Resource Competition on Integral Polymatroids.
WINE
Tobias Harks, Max Klimm, Britta Peis
2014 J jnl
Resource Competition on Integral Polymatroids.
CoRR
Tobias Harks, Max Klimm, Britta Peis
2014 A* conf
Routing games with progressive filling.
INFOCOM
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
2013 J jnl
Approximation Algorithms for Capacitated Location Routing.
Transp. Sci.
Tobias Harks, Felix G. König, Jannik Matuschke
2013 J jnl
Complexity and Approximation of the Continuous Network Design Problem.
CoRR
Martin Gairing, Tobias Harks, Max Klimm
2013 J jnl
Computing pure Nash and strong equilibria in bottleneck congestion games.
Math. Program.
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
2013 J jnl
Optimal Cost Sharing for Resource Selection Games.
Math. Oper. Res.
Philipp von Falkenhausen, Tobias Harks
2013 C conf
Optimal cost sharing for capacitated facility location games.
CTW
Philipp von Falkenhausen, Tobias Harks
2013 — conf
Quantitative Comparative Statics for a Multimarket Paradox.
WINE
Tobias Harks, Philipp von Falkenhausen
2013 J jnl
Quantitative Comparative Statics for a Multimarket Paradox.
CoRR
Tobias Harks, Philipp von Falkenhausen
2013 J jnl
Routing Games with Progressive Filling.
CoRR
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
2013 J jnl
Strong equilibria in games with the lexicographical improvement property.
Int. J. Game Theory
Tobias Harks, Max Klimm, Rolf H. Möhring
2012 J jnl
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
Math. Oper. Res.
Tobias Harks, Max Klimm
2012 J jnl
Resource Buying Games
CoRR
Tobias Harks, Britta Peis
2012 A conf
Resource Buying Games.
ESA
Tobias Harks, Britta Peis
2011 J jnl
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
Theory Comput. Syst.
Tobias Harks, Max Klimm, Rolf H. Möhring
2011 B conf
Congestion games with variable demands.
TARK
Tobias Harks, Max Klimm
2011 — conf
Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces.
WINE
Tobias Harks, Max Klimm
2011 B conf
Optimal File Distribution in Peer-to-Peer Networks.
ISAAC
Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller
2011 A* conf
Optimal cost sharing protocols for scheduling games.
EC
Philipp von Falkenhausen, Tobias Harks
2011 J jnl
Stackelberg Strategies and Collusion in Network Games with Splittable Flow.
Theory Comput. Syst.
Tobias Harks
2011 J jnl
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games.
Oper. Res.
Tobias Harks, Konstantin Miller
2010 — conf
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.
ESA (2)
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
2010 J jnl
Congestion Games with Variable Demands
CoRR
Tobias Harks, Max Klimm
2010 — conf
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
ICALP (1)
Tobias Harks, Max Klimm
2010 J jnl
Stackelberg Routing in Arbitrary Networks.
Math. Oper. Res.
Vincenzo Bonifaci, Tobias Harks, Guido Schäfer
2010 A* conf
The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks.
INFOCOM
André Berger, James Gross, Tobias Harks
2009 B conf
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
SAGT
Tobias Harks, Max Klimm, Rolf H. Möhring
2009 J jnl
Competitive Online Multicommodity Routing.
Theory Comput. Syst.
Tobias Harks, Stefan Heinz, Marc E. Pfetsch
2009 — conf
Efficiency and stability of Nash equilibria in resource allocation games.
GAMENETS
Tobias Harks, Konstantin Miller
2009 J jnl
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
CoRR
Tobias Harks, Max Klimm, Rolf H. Möhring
2009 — conf
Strong Nash Equilibria in Games with the Lexicographical Improvement Property.
WINE
Tobias Harks, Max Klimm, Rolf H. Möhring
2008 J jnl
Congestion control in utility fair networks.
Comput. Networks
Tobias Harks, Tobias Poschwatta
2008 — conf
Stackelberg Routing in Arbitrary Networks.
WINE
Vincenzo Bonifaci, Tobias Harks, Guido Schäfer
2008 B conf
Stackelberg Strategies and Collusion in Network Games with Splittable Flow.
WAOA
Tobias Harks
2008 A* conf
Utility Max-Min Fair Congestion Control with Time-Varying Delays.
INFOCOM
Konstantin Miller, Tobias Harks
2008 J jnl
iREX: efficient automation architecture for the deployment of inter-domain QoS policy.
IEEE Trans. Netw. Serv. Manag.
Ariffin Datuk Yahaya, Tobias Harks, Tatsuya Suda
2007 — conf
Nonadaptive Selfish Routing with Online Demands.
CAAN
Tobias Harks, László A. Végh
2006 B conf
Competitive Online Multicommodity Routing.
WAOA
Tobias Harks, Stefan Heinz, Marc E. Pfetsch
2006 — conf
On user strategies in a network implementing congestion pricing.
CCNC
Tobias Harks, Tobias Poschwatta
2006 A* conf
Utility Fair Congestion Control for Real-Time Traffic.
INFOCOM
Tobias Harks, Tobias Poschwatta
2006 B conf
iREX: Efficient Inter-Domain QoS Policy Architecture.
GLOBECOM
Ariffin Datuk Yahaya, Tobias Harks, Tatsuya Suda
2005 B conf
Priority Pricing in Utility Fair Networks.
ICNP
Tobias Harks, Tobias Poschwatta
2005 — conf
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach.
QoS-IP
Tobias Harks
2005 A* conf
Utility fair congestion control for real-time traffic.
INFOCOM
Tobias Harks, Tobias Poschwatta