Tobias Harks

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 62

Top Venues

CoRR

WINE

Math. Program.

ACM Trans. Economics and Comput.

Publications

José Correa, Tobias Harks, Anja Schedel, José Verschae
Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources. SODA (2024)
Lukas Graf, Tobias Harks, Julian Schwarz
A Decomposition Theorem for Dynamic Flows. CoRR (2024)
Tobias Harks, Sven Jäger, Michael Markl, Philine Schiewe
Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities. CoRR (2024)
Tobias Harks, Anja Schedel
Stackelberg pricing games with congestion effects. Math. Program. 203 (1) (2024)
Lukas Graf, Tobias Harks
Side-Constrained Dynamic Traffic Equilibria. EC (2023)
Tobias Harks, Julian Schwarz
A Unified Framework for Pricing in Nonconvex Resource Allocation Games. SIAM J. Optim. 33 (2) (2023)
Lukas Graf, Tobias Harks
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows. Math. Program. 197 (2) (2023)
Kai-Simon Goetzmann, Tobias Harks, Max Klimm
Correction to: Broadcasting a file in a communication network. J. Sched. 25 (2) (2022)
Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
Multi-Leader Congestion Games with an Adversary. AAAI (2022)
Tobias Harks, Veerle Timmermans
Equilibrium computation in resource allocation games. Math. Program. 194 (1) (2022)
Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment. AAAI (2022)
Lukas Graf, Tobias Harks
Side-Constrained Dynamic Traffic Equilibria. CoRR (2022)
Tobias Harks, Veerle Timmermans
Correction to: Equilibrium computation in resource allocation games. Math. Program. 194 (1) (2022)
Lukas Graf, Tobias Harks, Prashant Palkar
Dynamic Traffic Assignment for Electric Vehicles. CoRR (2022)
Lukas Graf, Tobias Harks, Prashant Palkar
Dynamic Traffic Assignment for Electric Vehicles. ATMOS (2022)
Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
Multi-Leader Congestion Games with an Adversary. CoRR (2021)
Tobias Harks, Julian Schwarz
Generalized Nash Equilibrium Problems with Mixed-Integer Variables. CoRR (2021)
Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment. CoRR (2021)
Lukas Graf, Tobias Harks
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows. IPCO (2021)
Giorgos Christodoulou, Tobias Harks
Introduction to the Special Issue on WINE'18: Part 1. ACM Trans. Economics and Comput. 9 (1) (2021)
Giorgos Christodoulou, Tobias Harks
Introduction to the Special Issue on WINE'18: Part 2. ACM Trans. Economics and Comput. 9 (2) (2021)
Tobias Harks, Max Klimm, Jannik Matuschke
Pure Nash Equilibria in Resource Graph Games. J. Artif. Intell. Res. 72 (2021)
Tobias Harks, Julian Schwarz
Generalized Nash Equilibrium Problems with Mixed-Integer Variables. WINE (2021)
Tobias Harks, Martin Hoefer, Anja Schedel, Manuel Surek
Efficient Black-Box Reductions for Separable Cost Sharing. Math. Oper. Res. 46 (1) (2021)
Kai-Simon Goetzmann, Tobias Harks, Max Klimm
Broadcasting a file in a communication network. J. Sched. 23 (2) (2020)
Tobias Harks, Max Klimm, Jannik Matuschke
Pure Nash Equilibria in Resource Graph Games. CoRR (2020)
Lukas Graf, Tobias Harks
The Price of Anarchy for Instantaneous Dynamic Equilibria. CoRR (2020)
Lukas Graf, Tobias Harks
The Price of Anarchy for Instantaneous Dynamic Equilibria. WINE (2020)
Lukas Graf, Tobias Harks
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows. CoRR (2020)
Lukas Graf, Tobias Harks, Leon Sering
Dynamic flows with adaptive route choice. Math. Program. 183 (1) (2020)
Tobias Harks, Anja Schedel, Manuel Surek
A Characterization of Undirected Graphs Admitting Optimal Cost Shares. SIAM J. Discret. Math. 33 (4) (2019)
Tobias Harks
Pricing in Resource Allocation Games Based on Duality Gaps. CoRR (2019)
Lukas Graf, Tobias Harks
Dynamic Flows with Adaptive Route Choice. IPCO (2019)
Tobias Harks, Anja Schedel
Capacity and Price Competition in Markets with Congestion Effects. WINE (2019)
Tobias Harks, Anja Schedel
Capacity and Price Competition in Markets with Congestion Effects. CoRR (2019)
Tobias Harks, Marc Schröder, Dries Vermeulen
Toll caps in privatized road networks. Eur. J. Oper. Res. 276 (3) (2019)
Lukas Graf, Tobias Harks
Dynamic Flows with Adaptive Route Choice. CoRR (2018)
Tobias Harks, Veerle Timmermans
Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs. CoRR (2018)
Tobias Harks, Max Klimm, Britta Peis
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. SIAM J. Optim. 28 (3) (2018)
Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch
Competitive Packet Routing with Priority Lists. ACM Trans. Economics and Comput. 6 (1) (2018)
Tobias Harks, Veerle Timmermans
Uniqueness of equilibria in atomic splittable polymatroid congestion games. J. Comb. Optim. 36 (3) (2018)
Tobias Harks, Martin Hoefer, Anja Huber, Manuel Surek
Efficient Black-Box Reductions for Separable Cost Sharing. CoRR (2018)
Tobias Harks, Marc Schröder, Dries Vermeulen
Toll Caps in Privatized Road Networks. CoRR (2018)
Roberto Cominetti, Tobias Harks, Carolina Osorio, Britta Peis
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102). Dagstuhl Reports 8 (3) (2018)
Tobias Harks, Max Klimm, Manuel Schneider
Bottleneck routing with elastic demands. Oper. Res. Lett. 46 (1) (2018)
Tobias Harks, Martin Hoefer, Anja Huber, Manuel Surek
Efficient Black-Box Reductions for Separable Cost Sharing. ICALP (2018)
Tobias Harks, Anja Huber, Manuel Surek
A Characterization of Undirected Graphs Admitting Optimal Cost Shares. WINE (2017)
José R. Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke
Fare Evasion in Transit Networks. Oper. Res. 65 (1) (2017)
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
Matroids Are Immune to Braess' Paradox. Math. Oper. Res. 42 (3) (2017)
Tobias Harks, Anja Huber, Manuel Surek
A Characterization of Undirected Graphs Admitting Optimal Cost Shares. CoRR (2017)
Martin Gairing, Tobias Harks, Max Klimm
Complexity and Approximation of the Continuous Network Design Problem. SIAM J. Optim. 27 (3) (2017)
Tobias Harks, Veerle Timmermans
Equilibrium Computation in Atomic Splittable Singleton Congestion Games. IPCO (2017)
Tobias Harks, Felix G. König, Jannik Matuschke, Alexander T. Richter, Jens Schulz
An Integrated Approach to Tactical Transportation Planning in Logistics Networks. Transp. Sci. 50 (2) (2016)
Tobias Harks, Philipp von Falkenhausen
Robust Quantitative Comparative Statics for a Multimarket Paradox. ACM Trans. Economics and Comput. 5 (1) (2016)
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
Routing Games With Progressive Filling. IEEE/ACM Trans. Netw. 24 (4) (2016)
Veerle Timmermans, Tobias Harks
Equilibrium Computation in Atomic Splittable Singleton Congestion Games. CoRR (2016)
Tobias Harks, Max Klimm, Britta Peis
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids. CoRR (2016)
Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch
Competitive Packet Routing with Priority Lists. MFCS (2016)
Tobias Harks, Tim Oosterwijk, Tjark Vredeveld
A logarithmic approximation for polymatroid congestion games. Oper. Res. Lett. 44 (6) (2016)
André Berger, James Gross, Tobias Harks, Simon Tenbusch
Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks. Manag. Sci. 62 (7) (2016)
Tobias Harks, Veerle Timmermans
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games. ISCO (2016)
Tobias Harks, Max Klimm
Congestion Games with Variable Demands. Math. Oper. Res. 41 (1) (2016)
Tobias Harks, Ingo Kleinert, Max Klimm, Rolf H. Möhring
Computing network tolls with support constraints. Networks 65 (3) (2015)
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
Congestion games viewed from M-convexity. Oper. Res. Lett. 43 (3) (2015)
Tobias Harks, Veerle Timmermans
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games. CoRR (2015)
Dimitris Fotakis, Tobias Harks
Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking. Theory Comput. Syst. 57 (3) (2015)
Tobias Harks, Max Klimm, Manuel Schneider
Bottleneck Routing with Elastic Demands. WINE (2015)
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
Matroids are Immune to Braess Paradox. CoRR (2015)
José R. Correa, Tobias Harks, Kai Nagel, Britta Peis, Martin Skutella
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412). Dagstuhl Reports 5 (10) (2015)
Tobias Harks, Britta Peis
Resource Buying Games. Algorithmica 70 (3) (2014)
Tobias Harks, Max Klimm, Britta Peis
Resource Competition on Integral Polymatroids. WINE (2014)
Tobias Harks, Max Klimm
Multimarket Oligopolies with Restricted Market Access. SAGT (2014)
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
Routing games with progressive filling. INFOCOM (2014)
Tobias Harks, Philipp von Falkenhausen
Optimal cost sharing for capacitated facility location games. Eur. J. Oper. Res. 239 (1) (2014)
Tobias Harks, Max Klimm, Britta Peis
Resource Competition on Integral Polymatroids. CoRR (2014)
Martin Gairing, Tobias Harks, Max Klimm
Complexity and Approximation of the Continuous Network Design Problem. APPROX-RANDOM (2014)
José R. Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke
Fare Evasion in Transit Networks. CoRR (2014)
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
Computing pure Nash and strong equilibria in bottleneck congestion games. Math. Program. 141 (1-2) (2013)
Tobias Harks, Felix G. König, Jannik Matuschke
Approximation Algorithms for Capacitated Location Routing. Transp. Sci. 47 (1) (2013)
Tobias Harks, Philipp von Falkenhausen
Quantitative Comparative Statics for a Multimarket Paradox. WINE (2013)
Tobias Harks, Max Klimm, Rolf H. Möhring
Strong equilibria in games with the lexicographical improvement property. Int. J. Game Theory 42 (2) (2013)
Tobias Harks, Philipp von Falkenhausen
Quantitative Comparative Statics for a Multimarket Paradox. CoRR (2013)
Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik
Routing Games with Progressive Filling. CoRR (2013)
Philipp von Falkenhausen, Tobias Harks
Optimal Cost Sharing for Resource Selection Games. Math. Oper. Res. 38 (1) (2013)
Martin Gairing, Tobias Harks, Max Klimm
Complexity and Approximation of the Continuous Network Design Problem. CoRR (2013)
Philipp von Falkenhausen, Tobias Harks
Optimal cost sharing for capacitated facility location games. CTW (2013)
Tobias Harks, Britta Peis
Resource Buying Games CoRR (2012)
Tobias Harks, Max Klimm
On the Existence of Pure Nash Equilibria in Weighted Congestion Games. Math. Oper. Res. 37 (3) (2012)
Tobias Harks, Britta Peis
Resource Buying Games. ESA (2012)
Tobias Harks, Max Klimm
Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces. WINE (2011)
Tobias Harks
Stackelberg Strategies and Collusion in Network Games with Splittable Flow. Theory Comput. Syst. 48 (4) (2011)
Tobias Harks, Max Klimm
Congestion games with variable demands. TARK (2011)
Philipp von Falkenhausen, Tobias Harks
Optimal cost sharing protocols for scheduling games. EC (2011)
Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller
Optimal File Distribution in Peer-to-Peer Networks. ISAAC (2011)
Tobias Harks, Konstantin Miller
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games. Oper. Res. 59 (6) (2011)
Tobias Harks, Max Klimm, Rolf H. Möhring
Characterizing the Existence of Potential Functions in Weighted Congestion Games. Theory Comput. Syst. 49 (1) (2011)
Vincenzo Bonifaci, Tobias Harks, Guido Schäfer
Stackelberg Routing in Arbitrary Networks. Math. Oper. Res. 35 (2) (2010)
Tobias Harks, Max Klimm
On the Existence of Pure Nash Equilibria in Weighted Congestion Games. ICALP (1) (2010)
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. ESA (2) (2010)
André Berger, James Gross, Tobias Harks
The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks. INFOCOM (2010)

Tobias Harks.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tobias Harks