Tobias Harks

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Stochastic Prediction Equilibrium for Dynamic Traffic Assignment	2024	Lukas Graf Tobias Harks Michael Markl
+ PDF Chat	Side-Constrained Dynamic Traffic Equilibria	2024	Lukas Graf Tobias Harks
+ PDF Chat	A Decomposition Theorem for Dynamic Flows	2024	Lukas Graf Tobias Harks Julian Schwarz
+ PDF Chat	Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities	2024	Tobias Harks Sven Jäger Michael Markl Philine Schiewe
+	Side-Constrained Dynamic Traffic Equilibria	2023	Lukas Graf Tobias Harks
+ PDF Chat	The Price of Anarchy for Instantaneous Dynamic Equilibria	2023	Lukas Graf Tobias Harks
+ PDF Chat	Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment	2022	Lukas Graf Tobias Harks Kostas Kollias Michael Markl
+ PDF Chat	Multi-Leader Congestion Games with an Adversary	2022	Tobias Harks Mona Henle Max Klimm Jannik Matuschke Anja Schedel
+ PDF Chat	A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows	2022	Lukas Graf Tobias Harks
+	Dynamic Traffic Assignment for Electric Vehicles	2022	Lukas Graf Tobias Harks Prashant Palkar
+	Side-Constrained Dynamic Traffic Equilibria	2022	Lukas Graf Tobias Harks
+ PDF Chat	Dynamic Traffic Assignment for Electric Vehicles	2022	Lukas Graf Tobias Harks Prashant Palkar
+ PDF Chat	Multi-Leader Congestion Games with an Adversary	2021	Tobias Harks Mona Henle Max Klimm Jannik Matuschke Anja Schedel
+ PDF Chat	Pure Nash Equilibria in Resource Graph Games	2021	Tobias Harks Max Klimm Jannik Matuschke
+ PDF Chat	A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows	2021	Lukas Graf Tobias Harks
+	Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment	2021	Lukas Graf Tobias Harks Kostas Kollias Michael Markl
+	Generalized Nash Equilibrium Problems with Mixed-Integer Variables	2021	Tobias Harks Julian Schwarz
+	Multi-Leader Congestion Games with an Adversary	2021	Tobias Harks Mona Henle Max Klimm Jannik Matuschke Anja Schedel
+ PDF Chat	Efficient Black-Box Reductions for Separable Cost Sharing	2020	Tobias Harks Martin Hoefer Anja Schedel Manuel Surek
+	Pure Nash Equilibria in Resource Graph Games	2020	Tobias Harks Max Klimm Jannik Matuschke
+ PDF Chat	Dynamic flows with adaptive route choice	2020	Lukas Graf Tobias Harks Leon Sering
+	Algorithmic Game Theory	2020	Tobias Harks Max Klimm
+ PDF Chat	The Price of Anarchy for Instantaneous Dynamic Equilibria	2020	Lukas Graf Tobias Harks
+	Pure Nash Equilibria in Resource Graph Games	2020	Tobias Harks Max Klimm Jannik Matuschke
+	The Price of Anarchy for Instantaneous Dynamic Equilibria	2020	Lukas Graf Tobias Harks
+	A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows	2020	Lukas Graf Tobias Harks
+	Pricing in Resource Allocation Games Based on Duality Gaps	2019	Tobias Harks
+	Capacity and Price Competition in Markets with Congestion Effects	2019	Tobias Harks Anja Schedel
+ PDF Chat	Toll caps in privatized road networks	2019	Tobias Harks Marc Schröder Dries Vermeulen
+ PDF Chat	Dynamic Flows with Adaptive Route Choice	2019	Lukas Graf Tobias Harks
+ PDF Chat	A Characterization of Undirected Graphs Admitting Optimal Cost Shares	2019	Tobias Harks Anja Schedel Manuel Surek
+	Pricing in Resource Allocation Games Based on Lagrangean Duality and Convexification	2019	Tobias Harks
+	Capacity and Price Competition in Markets with Congestion Effects	2019	Tobias Harks Anja Schedel
+	Dynamic Flows with Adaptive Route Choice	2018	Lukas Graf Tobias Harks Leon Sering
+	Efficient Black-Box Reductions for Separable Cost Sharing	2018	Tobias Harks Martin Hoefer Anja Huber Manuel Surek
+ PDF Chat	Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids	2018	Tobias Harks Max Klimm Britta Peis
+	Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs	2018	Tobias Harks Veerle Timmermans
+	Efficient Black-Box Reductions for Separable Cost Sharing	2018	Tobias Harks Martin Hoefer Anja Huber Manuel Surek
+	Efficient Black-Box Reductions for Separable Cost Sharing	2018	Tobias Harks Martin Hoefer Anja Huber Manuel Surek
+ PDF Chat	Matroids Are Immune to Braess’ Paradox	2017	Satoru Fujishige Michel X. Goemans Tobias Harks Britta Peis Rico Zenklusen
+ PDF Chat	Fare Evasion in Transit Networks	2017	José R. Correa Tobias Harks Vincent J. C. Kreuzen Jannik Matuschke
+ PDF Chat	A Characterization of Undirected Graphs Admitting Optimal Cost Shares	2017	Tobias Harks Anja Huber Manuel Surek
+ PDF Chat	Complexity and Approximation of the Continuous Network Design Problem	2017	Martin Gairing Tobias Harks Max Klimm
+	A Characterization of Undirected Graphs Admitting Optimal Cost Shares	2017	Tobias Harks Anja Huber Manuel Surek
+	Equilibrium Computation in Resource Allocation Games	2016	Veerle Timmermans Tobias Harks
+	Equilibrium Computation in Atomic Splittable Singleton Congestion Games	2016	Veerle Timmermans Tobias Harks
+	Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids	2016	Tobias Harks Max Klimm Britta Peis
+ PDF Chat	Robust Quantitative Comparative Statics for a Multimarket Paradox	2016	Tobias Harks Philipp von Falkenhausen
+ PDF Chat	Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games	2016	Tobias Harks Veerle Timmermans
+	Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids	2016	Tobias Harks Max Klimm Britta Peis
+	Equilibrium Computation in Resource Allocation Games	2016	Veerle Timmermans Tobias Harks
+ PDF Chat	Congestion Games with Variable Demands	2015	Tobias Harks Max Klimm
+	Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games	2015	Tobias Harks Veerle Timmermans
+ PDF Chat	Routing Games With Progressive Filling	2015	Tobias Harks Martin Hoefer Kevin Schewior Alexander Skopalik
+	Matroids are Immune to Braess Paradox	2015	Satoru Fujishige Michel X. Goemans Tobias Harks Britta Peis Rico Zenklusen
+	Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games	2015	Tobias Harks Veerle Timmermans
+	Matroids are Immune to Braess Paradox	2015	Satoru Fujishige Michel X. Goemans Tobias Harks Britta Peis Rico Zenklusen
+	Resource Competition on Integral Polymatroids	2014	Tobias Harks Max Klimm Britta Peis
+	Fare Evasion in Transit Networks	2014	José R. Correa Tobias Harks Vincent J. C. Kreuzen Jannik Matuschke
+ PDF Chat	Routing games with progressive filling	2014	Tobias Harks Martin Hoefer Kevin Schewior Alexander Skopalik
+ PDF Chat	Resource Competition on Integral Polymatroids	2014	Tobias Harks Max Klimm Britta Peis
+	Resource Competition on Integral Polymatroids	2014	Tobias Harks Max Klimm Britta Peis
+	Fare Evasion in Transit Networks	2014	José R. Correa Tobias Harks Vincent J. C. Kreuzen Jannik Matuschke
+	Robust Quantitative Comparative Statics for a Multimarket Paradox	2013	Tobias Harks Philipp von Falkenhausen
+	Quantitative Comparative Statics for a Multimarket Paradox	2013	Tobias Harks Philipp von Falkenhausen
+	Complexity and Approximation of the Continuous Network Design Problem	2013	Martin Gairing Tobias Harks Max Klimm
+ PDF Chat	Quantitative Comparative Statics for a Multimarket Paradox	2013	Tobias Harks Philipp von Falkenhausen
+	Robust Quantitative Comparative Statics for a Multimarket Paradox	2013	Tobias Harks Philipp von Falkenhausen
+	Routing Games with Progressive Filling	2013	Tobias Harks Martin Hoefer Kevin Schewior Alexander Skopalik
+	Complexity and Approximation of the Continuous Network Design Problem	2013	Martin Gairing Tobias Harks Max Klimm
+	Resource Buying Games	2012	Tobias Harks Britta Peis
+	Resource Buying Games	2012	Tobias Harks Britta Peis
+ PDF Chat	Congestion games with variable demands	2011	Tobias Harks Max Klimm
+	Congestion Games with Variable Demands	2010	Tobias Harks Max Klimm
+	Congestion Games with Variable Demands	2010	Tobias Harks Max Klimm
+ PDF Chat	Strong Nash Equilibria in Games with the Lexicographical Improvement Property	2009	Tobias Harks Max Klimm Rolf H. Möhring
+	Strong Nash Equilibria in Games with the Lexicographical Improvement Property	2009	Tobias Harks Max Klimm Rolf H. Moehring

Common Coauthors

Coauthor	Papers Together
Max Klimm	22
Lukas Graf	14
Britta Peis	11
Jannik Matuschke	9
Anja Schedel	7
Manuel Surek	7
Martin Hoefer	7
Veerle Timmermans	7
Philipp von Falkenhausen	5
Lukas Graf	5
Michael Markl	4
Martin Gairing	3
Alexander Skopalik	3
José R. Correa	3
Mona Henle	3
Vincent J. C. Kreuzen	3
Anja Huber	3
Satoru Fujishige	3
Rico Zenklusen	3
Kevin Schewior	3
Michel X. Goemans	3
Julian Schwarz	2
Prashant Palkar	2
Kostas Kollias	2
Anja Huber	2
Leon Sering	2
Philine Schiewe	1
Sven Jäger	1
Marc Schröder	1
Rolf H. Moehring	1
Dries Vermeulen	1
Rolf H. Möhring	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Dynamic Equilibria in Fluid Queueing Networks	2015	Roberto Cominetti José R. Correa Omar Larré	10
+ PDF Chat	Dynamic flows with adaptive route choice	2020	Lukas Graf Tobias Harks Leon Sering	7
+ PDF Chat	Routing Games over Time with FIFO Policy	2017	Anisse Ismaïli	7
+ PDF Chat	A Stackelberg strategy for routing flow over time	2013	Umang Bhaskar Lisa Fleischer Elliot Anshelevich	6
+	A generalization of Brouwer’s fixed point theorem	1941	Shizuo Kakutani	6
+	None	2011	J.L. Rami ́rez Alfonsi ́n Sándor Z. Kiss Imre Z. Ruzsa Carlos Vinuesa	6
+ PDF Chat	Computation of Dynamic Equilibria in Series-Parallel Networks	2021	Marcus Kaiser	4
+ PDF Chat	Optimization flow control. I. Basic algorithm and convergence	1999	Steven H. Low D.E. Lapsely	4
+ PDF Chat	A Network Game of Dynamic Traffic	2017	Zhigang Cao Bo Chen Xujin Chen Changjun Wang	4
+ PDF Chat	Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces	1952	Ky Fan	4
+ PDF Chat	An upper bound on the price of stability for undirected Shapley network design games	2009	Jian Li	4
+ PDF Chat	Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks	2017	Roberto Cominetti José R. Correa Neil Olver	4
+	Resource Competition on Integral Polymatroids	2014	Tobias Harks Max Klimm Britta Peis	4
+ PDF Chat	Improving the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-bound on the price of stability in undirected Shapley network design games	2014	Yann Disser Andreas Emil Feldmann Max Klimm Matúš Mihaľák	4
+ PDF Chat	The Price of Anarchy for Instantaneous Dynamic Equilibria	2020	Lukas Graf Tobias Harks	3
+ PDF Chat	A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows	2022	Lukas Graf Tobias Harks	3
+ PDF Chat	Existence and Uniqueness of Equilibrium Points for Concave N-Person Games	1965	Judah B Rosen	3
+ PDF Chat	Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids	2018	Tobias Harks Max Klimm Britta Peis	3
+ PDF Chat	Inefficiencies in network models: A graph-theoretic perspective	2017	Pietro Cenciarelli Daniele Gorla Ivano Salvo	3
+	Nash flows over time with spillback	2019	Leon Sering Laura Vargas Koch	3
+ PDF Chat	Strong Nash Equilibria in Games with the Lexicographical Improvement Property	2009	Tobias Harks Max Klimm Rolf H. Möhring	3
+	Stackelberg Network Pricing Games	2010	Patrick Briest Martin Hoefer Piotr Krysta	3
+ PDF Chat	Efficiency Loss in a Network Resource Allocation Game	2004	Ramesh Johari John N. Tsitsiklis	3
+ PDF Chat	Congestion games with variable demands	2011	Tobias Harks Max Klimm	3
+ PDF Chat	Convergence of a Packet Routing Model to Flows Over Time	2021	Leon Sering Laura Vargas Koch Theresa Ziemke	2
+ PDF Chat	The problem of optimal smoothing for convex functions	2002	Mohammad Ghomi	2
+ PDF Chat	Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks	2021	Roberto Cominetti José R. Correa Neil Olver	2
+ PDF Chat	An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games	2014	Akaki Mamageishvili Matúš Mihaľák Simone Montemezzani	2
+	Refined proximity and sensitivity results in linearly constrained convex separable integer programming	1995	Ross Baldick	2
+ PDF Chat	Sharing Non-anonymous Costs of Multiple Resources Optimally	2015	Max Klimm Daniel Schmand	2
+ PDF Chat	Dynamic Atomic Congestion Games with Seasonal Flows	2018	Marco Scarsini Marc Schröder Tristan Tomala	2
+	Algorithms for flows over time with scheduling costs	2019	Dario Frascaria Neil Olver	2
+ PDF Chat	The Impact of Spillback on the Price of Anarchy for Flows over Time	2020	Jonas Israel Leon Sering	2
+ PDF Chat	Public transport networks: empirical analysis and modeling	2009	Christian von Ferber Taras Holovatch Yurij Holovatch Vasyl Palchykov	2
+	Discrete Convex Analysis	2003	Kazuo Murota	2
+ PDF Chat	Strategic cooperation in cost sharing games	2011	Martin Hoefer	2
+ PDF Chat	Toll caps in privatized road networks	2019	Tobias Harks Marc Schröder Dries Vermeulen	2
+ PDF Chat	A Characterization of Undirected Graphs Admitting Optimal Cost Shares	2019	Tobias Harks Anja Schedel Manuel Surek	2
+	The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality	1986	Awi Federgruen Henri Groenevelt	2
+	Computing Nash equilibria of action-graph games	2004	Navin A. R. Bhat Kevin Leyton‐Brown	2
+ PDF Chat	Existence of simultaneous route and departure choice dynamic user equilibrium	2013	Ke Han Terry L. Friesz Tao Yao	2
+	Équations et inéquations non linéaires dans les espaces vectoriels en dualité	1968	Haı̈m Brezis	2
+	An Approximation Algorithm for Stackelberg Network Pricing	2004	Sébastien Roch Gilles Savard Patrice Marcotte	2
+ PDF Chat	An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem	2010	Jarosław Byrka Karen Aardal	2
+ PDF Chat	Resource Competition on Integral Polymatroids	2014	Tobias Harks Max Klimm Britta Peis	2
+	Graphical Models for Game Theory	2013	Michael Kearns Michael L. Littman Satinder Singh	2
+ PDF Chat	Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games	2014	Ragavendran Gopalakrishnan Jason R. Marden Adam Wierman	2
+ PDF Chat	An overview of bilevel optimization	2007	Benoît Colson Patrice Marcotte Gilles Savard	2
+ PDF Chat	Computational analysis of perfect-information position auctions	2017	David R. M. Thompson Kevin Leyton‐Brown	2
+	Some Implementations of the Boxplot	1989	Michael Frigge David C. Hoaglin Boris Iglewicz	1