Tobias Harks

Anja Schedel

Math. Program., January, 2024

Stochastic Prediction Equilibrium for Dynamic Traffic Assignment.

[BibT_eX]

[DOI]

Michael Markl

CoRR, 2024

A Decomposition Theorem for Dynamic Flows.

[BibT_eX]

[DOI]

Julian Schwarz

CoRR, 2024

Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities.

[BibT_eX]

[DOI]

Proceedings of the 24th Symposium on Algorithmic Approaches for Transportation Modelling, 2024

2023

A Unified Framework for Pricing in Nonconvex Resource Allocation Games.

[BibT_eX]

[DOI]

Julian Schwarz

SIAM J. Optim., June, 2023

A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows.

[BibT_eX]

[DOI]

Math. Program., February, 2023

Prediction Equilibrium for Dynamic Network Flows.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

Side-Constrained Dynamic Traffic Equilibria.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

Correction to: Broadcasting a file in a communication network.

[BibT_eX]

[DOI]

Kai-Simon Goetzmann

J. Sched., 2022

Correction to: Equilibrium computation in resource allocation games.

[BibT_eX]

[DOI]

Math. Program., 2022

Equilibrium computation in resource allocation games.

[BibT_eX]

[DOI]

Math. Program., 2022

Dynamic Traffic Assignment for Electric Vehicles.

[BibT_eX]

[DOI]

Prashant Palkar

Proceedings of the 22nd Symposium on Algorithmic Approaches for Transportation Modelling, 2022

Multi-Leader Congestion Games with an Adversary.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Introduction to the Special Issue on WINE'18: Part 2.

[BibT_eX]

[DOI]

Giorgos Christodoulou

ACM Trans. Economics and Comput., 2021

Introduction to the Special Issue on WINE'18: Part 1.

[BibT_eX]

[DOI]

Giorgos Christodoulou

ACM Trans. Economics and Comput., 2021

Efficient Black-Box Reductions for Separable Cost Sharing.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Pure Nash Equilibria in Resource Graph Games.

[BibT_eX]

[DOI]

Jannik Matuschke

J. Artif. Intell. Res., 2021

Generalized Nash Equilibrium Problems with Mixed-Integer Variables.

[BibT_eX]

[DOI]

Julian Schwarz

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2020

Broadcasting a file in a communication network.

[BibT_eX]

[DOI]

Kai-Simon Goetzmann

J. Sched., 2020

Dynamic flows with adaptive route choice.

[BibT_eX]

[DOI]

Leon Sering

Math. Program., 2020

The Price of Anarchy for Instantaneous Dynamic Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

2019

A Characterization of Undirected Graphs Admitting Optimal Cost Shares.

[BibT_eX]

[DOI]

Anja Schedel

Manuel Surek

SIAM J. Discret. Math., 2019

Toll caps in privatized road networks.

[BibT_eX]

[DOI]

Marc Schröder

Dries Vermeulen

Eur. J. Oper. Res., 2019

Pricing in Resource Allocation Games Based on Duality Gaps.

[BibT_eX]

[DOI]

CoRR, 2019

Capacity and Price Competition in Markets with Congestion Effects.

[BibT_eX]

[DOI]

Anja Schedel

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Dynamic Flows with Adaptive Route Choice.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

Competitive Packet Routing with Priority Lists.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2018

Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

Bottleneck routing with elastic demands.

[BibT_eX]

[DOI]

Manuel Schneider

Oper. Res. Lett., 2018

Uniqueness of equilibria in atomic splittable polymatroid congestion games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

2017

Complexity and Approximation of the Continuous Network Design Problem.

[BibT_eX]

[DOI]

Martin Gairing

SIAM J. Optim., 2017

Matroids Are Immune to Braess' Paradox.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

Fare Evasion in Transit Networks.

[BibT_eX]

[DOI]

José Correa

Vincent J. C. Kreuzen

Jannik Matuschke

Oper. Res., 2017

Equilibrium Computation in Atomic Splittable Singleton Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

An Integrated Approach to Tactical Transportation Planning in Logistics Networks.

[BibT_eX]

[DOI]

Transp. Sci., 2016

Routing Games With Progressive Filling.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Robust Quantitative Comparative Statics for a Multimarket Paradox.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

A logarithmic approximation for polymatroid congestion games.

[BibT_eX]

[DOI]

Tim Oosterwijk

Tjark Vredeveld

Oper. Res. Lett., 2016

Congestion Games with Variable Demands.

[BibT_eX]

[DOI]

Math. Oper. Res., 2016

Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks.

[BibT_eX]

[DOI]

Manag. Sci., 2016

Competitive Packet Routing with Priority Lists.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Congestion games viewed from M-convexity.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

Computing network tolls with support constraints.

[BibT_eX]

[DOI]

Networks, 2015

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

[BibT_eX]

[DOI]

Dimitris Fotakis

Theory Comput. Syst., 2015

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

Resource Buying Games.

[BibT_eX]

[DOI]

Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014

Optimal cost sharing for capacitated facility location games.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Resource Buying Games.

[BibT_eX]

[DOI]

Algorithmica, 2014

Resource Competition on Integral Polymatroids.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Multimarket Oligopolies with Restricted Market Access.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013

Approximation Algorithms for Capacitated Location Routing.

[BibT_eX]

[DOI]

Felix G. König

Jannik Matuschke

Transp. Sci., 2013

Computing pure Nash and strong equilibria in bottleneck congestion games.

[BibT_eX]

[DOI]

Math. Program., 2013

Optimal Cost Sharing for Resource Selection Games.

[BibT_eX]

[DOI]

Math. Oper. Res., 2013

Strong equilibria in games with the lexicographical improvement property.

[BibT_eX]

[DOI]

Rolf H. Möhring

Int. J. Game Theory, 2013

Quantitative Comparative Statics for a Multimarket Paradox.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

On the Existence of Pure Nash Equilibria in Weighted Congestion Games.

[BibT_eX]

[DOI]

Math. Oper. Res., 2012

2011

Characterizing the Existence of Potential Functions in Weighted Congestion Games.

[BibT_eX]

[DOI]

Rolf H. Möhring

Theory Comput. Syst., 2011

Stackelberg Strategies and Collusion in Network Games with Splittable Flow.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games.

[BibT_eX]

[DOI]

Konstantin Miller

Oper. Res., 2011

Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Optimal cost sharing protocols for scheduling games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Optimal File Distribution in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Stackelberg Routing in Arbitrary Networks.

[BibT_eX]

[DOI]

Vincenzo Bonifaci

Guido Schäfer

Math. Oper. Res., 2010

The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks.

[BibT_eX]

[DOI]

André Berger

James Gross

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

Competitive Online Multicommodity Routing.

[BibT_eX]

[DOI]

Stefan Heinz

Marc E. Pfetsch

Theory Comput. Syst., 2009

Strong Nash Equilibria in Games with the Lexicographical Improvement Property.

[BibT_eX]

[DOI]

Rolf H. Möhring

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Efficiency and stability of Nash equilibria in resource allocation games.

[BibT_eX]

[DOI]

Konstantin Miller

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.

[BibT_eX]

[DOI]

Ariffin Datuk Yahaya

Tatsuya Suda

IEEE Trans. Netw. Serv. Manag., 2008

Congestion control in utility fair networks.

[BibT_eX]

[DOI]

Comput. Networks, 2008

Utility Max-Min Fair Congestion Control with Time-Varying Delays.

[BibT_eX]

[DOI]

Konstantin Miller

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

Nonadaptive Selfish Routing with Online Demands.

[BibT_eX]

[DOI]

László A. Végh

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

iREX: Efficient Inter-Domain QoS Policy Architecture.

[BibT_eX]

[DOI]

Ariffin Datuk Yahaya

Tatsuya Suda

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.

[BibT_eX]

[DOI]

Proceedings of the 3rd IEEE Consumer Communications and Networking Conference, 2006

2005

Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach.

[BibT_eX]

[DOI]

Proceedings of the Quality of Service in Multiservice IP Networks, 2005

Utility fair congestion control for real-time traffic.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Priority Pricing in Utility Fair Networks.

[BibT_eX]

[DOI]