Tobias Harks

From MaRDI portal
Person:297092

Available identifiers

zbMath Open harks.tobiasMaRDI QIDQ297092

List of research outcomes





PublicationDate of PublicationType
Generalized Nash equilibrium problems with mixed-integer variables2025-01-17Paper
Equilibrium dynamics in market games with exchangeable and divisible resources2024-11-28Paper
Dynamic traffic assignment for electric vehicles2024-07-10Paper
The Price of Anarchy for Instantaneous Dynamic Equilibria2024-03-01Paper
Stackelberg pricing games with congestion effects2024-02-21Paper
A Unified Framework for Pricing in Nonconvex Resource Allocation Games2023-07-12Paper
The price of anarchy for instantaneous dynamic equilibria2023-03-21Paper
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows2023-03-14Paper
Correction to: ``Equilibrium computation in resource allocation games2022-06-29Paper
Equilibrium computation in resource allocation games2022-06-29Paper
Pure Nash Equilibria in Resource Graph Games2022-02-07Paper
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows2021-12-21Paper
https://portal.mardi4nfdi.de/entity/Q50028442021-07-28Paper
Efficient Black-Box Reductions for Separable Cost Sharing2021-06-03Paper
Dynamic flows with adaptive route choice2020-08-28Paper
Broadcasting a file in a communication network2020-04-22Paper
Dynamic flows with adaptive route choice2020-02-06Paper
A Characterization of Undirected Graphs Admitting Optimal Cost Shares2019-10-28Paper
Bottleneck routing with elastic demands2019-06-11Paper
Toll caps in privatized road networks2019-03-27Paper
A Characterization of Undirected Graphs Admitting Optimal Cost Shares2019-01-30Paper
A logarithmic approximation for polymatroid congestion games2019-01-15Paper
Uniqueness of equilibria in atomic splittable polymatroid congestion games2018-12-06Paper
Congestion games viewed from M-convexity2018-09-28Paper
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids2018-08-21Paper
Computing network tolls with support constraints2018-05-23Paper
Competitive Packet Routing with Priority Lists2018-03-21Paper
Matroids Are Immune to Braess’ Paradox2017-09-22Paper
Equilibrium computation in atomic splittable singleton congestion games2017-08-31Paper
Complexity and Approximation of the Continuous Network Design Problem2017-08-16Paper
Fare Evasion in Transit Networks2017-06-02Paper
Complexity and Approximation of the Continuous Network Design Problem2017-03-22Paper
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games2016-11-30Paper
Optimal cost sharing for capacitated facility location games2016-06-24Paper
Congestion games with variable demands2016-04-15Paper
Bottleneck Routing with Elastic Demands2016-01-08Paper
Equilibria in a class of aggregative location games2015-12-18Paper
Resource buying games2015-01-19Paper
Multimarket Oligopolies with Restricted Market Access2015-01-14Paper
Resource Competition on Integral Polymatroids2015-01-07Paper
On the existence of pure Nash equilibria in weighted congestion games2014-10-21Paper
Optimal Cost Sharing for Resource Selection Games2014-07-11Paper
Computing pure Nash and strong equilibria in bottleneck congestion games2013-11-11Paper
Strong equilibria in games with the lexicographical improvement property2013-06-26Paper
Resource Buying Games2012-09-25Paper
The worst-case efficiency of cost sharing methods in resource allocation games2012-06-26Paper
Optimal File Distribution in Peer-to-Peer Networks2011-12-16Paper
Characterizing the existence of potential functions in weighted congestion games2011-11-23Paper
Stackelberg strategies and collusion in network games with splittable flow2011-05-25Paper
Stackelberg Routing in Arbitrary Networks2011-04-27Paper
On the Existence of Pure Nash Equilibria in Weighted Congestion Games2010-09-07Paper
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games2010-09-06Paper
Characterizing the Existence of Potential Functions in Weighted Congestion Games2009-12-01Paper
Competitive online multicommodity routing2009-09-02Paper
Stackelberg Strategies and Collusion in Network Games with Splittable Flow2009-02-12Paper
Congestion control in utility fair networks2009-01-20Paper
Nonadaptive Selfish Routing with Online Demands2008-04-15Paper
Competitive Online Multicommodity Routing2008-02-21Paper

Research outcomes over time

This page was built for person: Tobias Harks