Tobias Harks

According to our database1, Tobias Harks authored at least 85 papers between 2005 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Toll caps in privatized road networks.
European Journal of Operational Research, 2019

Pricing in Resource Allocation Games Based on Duality Gaps.
CoRR, 2019

Capacity and Price Competition in Markets with Congestion Effects.
CoRR, 2019

Dynamic Flows with Adaptive Route Choice.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
Competitive Packet Routing with Priority Lists.
ACM Trans. Economics and Comput., 2018

Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids.
SIAM Journal on Optimization, 2018

Bottleneck routing with elastic demands.
Oper. Res. Lett., 2018

Uniqueness of equilibria in atomic splittable polymatroid congestion games.
J. Comb. Optim., 2018

Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102).
Dagstuhl Reports, 2018

Dynamic Flows with Adaptive Route Choice.
CoRR, 2018

Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs.
CoRR, 2018

Toll Caps in Privatized Road Networks.
CoRR, 2018

Efficient Black-Box Reductions for Separable Cost Sharing.
CoRR, 2018

Efficient Black-Box Reductions for Separable Cost Sharing.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Complexity and Approximation of the Continuous Network Design Problem.
SIAM Journal on Optimization, 2017

Matroids Are Immune to Braess' Paradox.
Math. Oper. Res., 2017

Fare Evasion in Transit Networks.
Operations Research, 2017

A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
CoRR, 2017

A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Equilibrium Computation in Atomic Splittable Singleton Congestion Games.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
An Integrated Approach to Tactical Transportation Planning in Logistics Networks.
Transportation Science, 2016

Routing Games With Progressive Filling.
IEEE/ACM Trans. Netw., 2016

Robust Quantitative Comparative Statics for a Multimarket Paradox.
ACM Trans. Economics and Comput., 2016

A logarithmic approximation for polymatroid congestion games.
Oper. Res. Lett., 2016

Congestion Games with Variable Demands.
Math. Oper. Res., 2016

Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks.
Management Science, 2016

Equilibrium Computation in Atomic Splittable Singleton Congestion Games.
CoRR, 2016

Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids.
CoRR, 2016

Competitive Packet Routing with Priority Lists.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Congestion games viewed from M-convexity.
Oper. Res. Lett., 2015

Computing network tolls with support constraints.
Networks, 2015

Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking.
Theory Comput. Syst., 2015

Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412).
Dagstuhl Reports, 2015

Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games.
CoRR, 2015

Matroids are Immune to Braess Paradox.
CoRR, 2015

Bottleneck Routing with Elastic Demands.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2014
Optimal cost sharing for capacitated facility location games.
European Journal of Operational Research, 2014

Resource Competition on Integral Polymatroids.
CoRR, 2014

Fare Evasion in Transit Networks.
CoRR, 2014

Resource Buying Games.
Algorithmica, 2014

Resource Competition on Integral Polymatroids.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Multimarket Oligopolies with Restricted Market Access.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Routing games with progressive filling.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Complexity and Approximation of the Continuous Network Design Problem.
Proceedings of the Approximation, 2014

2013
Approximation Algorithms for Capacitated Location Routing.
Transportation Science, 2013

Computing pure Nash and strong equilibria in bottleneck congestion games.
Math. Program., 2013

Optimal Cost Sharing for Resource Selection Games.
Math. Oper. Res., 2013

Strong equilibria in games with the lexicographical improvement property.
Int. J. Game Theory, 2013

Routing Games with Progressive Filling.
CoRR, 2013

Quantitative Comparative Statics for a Multimarket Paradox.
CoRR, 2013

Complexity and Approximation of the Continuous Network Design Problem.
CoRR, 2013

Quantitative Comparative Statics for a Multimarket Paradox.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Optimal cost sharing for capacitated facility location games.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
Math. Oper. Res., 2012

Resource Buying Games
CoRR, 2012

Resource Buying Games.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
Theory Comput. Syst., 2011

Stackelberg Strategies and Collusion in Network Games with Splittable Flow.
Theory Comput. Syst., 2011

The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games.
Operations Research, 2011

Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Congestion games with variable demands.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Optimal cost sharing protocols for scheduling games.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Optimal File Distribution in Peer-to-Peer Networks.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Stackelberg Routing in Arbitrary Networks.
Math. Oper. Res., 2010

Congestion Games with Variable Demands
CoRR, 2010

The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.
Proceedings of the Algorithms, 2010

2009
Competitive Online Multicommodity Routing.
Theory Comput. Syst., 2009

Strong Nash Equilibria in Games with the Lexicographical Improvement Property
CoRR, 2009

Strong Nash Equilibria in Games with the Lexicographical Improvement Property.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Characterizing the Existence of Potential Functions in Weighted Congestion Games.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Efficiency and stability of Nash equilibria in resource allocation games.
Proceedings of the 1st International Conference on Game Theory for Networks, 2009

2008
iREX: efficient automation architecture for the deployment of inter-domain QoS policy.
IEEE Trans. Network and Service Management, 2008

Congestion control in utility fair networks.
Computer Networks, 2008

Stackelberg Routing in Arbitrary Networks.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Stackelberg Strategies and Collusion in Network Games with Splittable Flow.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Utility Max-Min Fair Congestion Control with Time-Varying Delays.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
Nonadaptive Selfish Routing with Online Demands.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006
Competitive Online Multicommodity Routing.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

iREX: Efficient Inter-Domain QoS Policy Architecture.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach.
Proceedings of the Quality of Service in Multiservice IP Networks, 2005

Utility fair congestion control for real-time traffic.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Priority Pricing in Utility Fair Networks.
Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP 2005), 2005


  Loading...