Tobias Harks

According to our database1, Tobias Harks authored at least 65 papers between 2005 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Introduction to the Special Issue on WINE'18: Part 2.
ACM Trans. Economics and Comput., 2021

Introduction to the Special Issue on WINE'18: Part 1.
ACM Trans. Economics and Comput., 2021

Efficient Black-Box Reductions for Separable Cost Sharing.
Math. Oper. Res., 2021

A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020
Broadcasting a file in a communication network.
J. Sched., 2020

Dynamic flows with adaptive route choice.
Math. Program., 2020

Pure Nash Equilibria in Resource Graph Games.
CoRR, 2020

The Price of Anarchy for Instantaneous Dynamic Equilibria.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

2019
A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
SIAM J. Discret. Math., 2019

Toll caps in privatized road networks.
Eur. J. Oper. Res., 2019

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

Capacity and Price Competition in Markets with Congestion Effects.
Proceedings of the Web and Internet Economics - 15th International Conference, 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 J. Optim., 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

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

2017
Complexity and Approximation of the Continuous Network Design Problem.
SIAM J. Optim., 2017

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

Fare Evasion in Transit Networks.
Oper. Res., 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.
Transp. Sci., 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.
Manag. Sci., 2016

Competitive Packet Routing with Priority Lists.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 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

Resource Buying Games.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
Optimal cost sharing for capacitated facility location games.
Eur. J. Oper. Res., 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

2013
Approximation Algorithms for Capacitated Location Routing.
Transp. Sci., 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

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

2012
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
Math. Oper. Res., 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.
Oper. Res., 2011

Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces.
Proceedings of the Internet and Network Economics - 7th International Workshop, 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

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

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

Strong Nash Equilibria in Games with the Lexicographical Improvement Property.
Proceedings of the Internet and Network Economics, 5th International Workshop, 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. Netw. Serv. Manag., 2008

Congestion control in utility fair networks.
Comput. Networks, 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
Utility Fair Congestion Control for Real-Time Traffic.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

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

On user strategies in a network implementing congestion pricing.
Proceedings of the 3rd IEEE Consumer Communications and Networking Conference, 2006

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

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


  Loading...