| Publication | Date of Publication | Type |
|---|
| The Price of Anarchy for Instantaneous Dynamic Equilibria | 2024-03-01 | Paper |
| Stackelberg pricing games with congestion effects | 2024-02-21 | Paper |
| A Unified Framework for Pricing in Nonconvex Resource Allocation Games | 2023-07-12 | Paper |
| The price of anarchy for instantaneous dynamic equilibria | 2023-03-21 | Paper |
| A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows | 2023-03-14 | Paper |
| Equilibrium computation in resource allocation games | 2022-06-29 | Paper |
| Correction to: ``Equilibrium computation in resource allocation games | 2022-06-29 | Paper |
| Pure Nash Equilibria in Resource Graph Games | 2022-02-07 | Paper |
| A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows | 2021-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002844 | 2021-07-28 | Paper |
| Efficient Black-Box Reductions for Separable Cost Sharing | 2021-06-03 | Paper |
| Dynamic flows with adaptive route choice | 2020-08-28 | Paper |
| Broadcasting a file in a communication network | 2020-04-22 | Paper |
| Dynamic flows with adaptive route choice | 2020-02-06 | Paper |
| A Characterization of Undirected Graphs Admitting Optimal Cost Shares | 2019-10-28 | Paper |
| Bottleneck routing with elastic demands | 2019-06-11 | Paper |
| Toll caps in privatized road networks | 2019-03-27 | Paper |
| A Characterization of Undirected Graphs Admitting Optimal Cost Shares | 2019-01-30 | Paper |
| A logarithmic approximation for polymatroid congestion games | 2019-01-15 | Paper |
| Uniqueness of equilibria in atomic splittable polymatroid congestion games | 2018-12-06 | Paper |
| Congestion games viewed from M-convexity | 2018-09-28 | Paper |
| Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids | 2018-08-21 | Paper |
| Computing network tolls with support constraints | 2018-05-23 | Paper |
| Competitive Packet Routing with Priority Lists | 2018-03-21 | Paper |
| Matroids Are Immune to Braess’ Paradox | 2017-09-22 | Paper |
| Equilibrium computation in atomic splittable singleton congestion games | 2017-08-31 | Paper |
| Complexity and Approximation of the Continuous Network Design Problem | 2017-08-16 | Paper |
| Fare Evasion in Transit Networks | 2017-06-02 | Paper |
| Complexity and Approximation of the Continuous Network Design Problem | 2017-03-22 | Paper |
| Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games | 2016-11-30 | Paper |
| Optimal cost sharing for capacitated facility location games | 2016-06-24 | Paper |
| Congestion Games with Variable Demands | 2016-04-15 | Paper |
| Bottleneck Routing with Elastic Demands | 2016-01-08 | Paper |
| Equilibria in a class of aggregative location games | 2015-12-18 | Paper |
| Resource buying games | 2015-01-19 | Paper |
| Multimarket Oligopolies with Restricted Market Access | 2015-01-14 | Paper |
| Resource Competition on Integral Polymatroids | 2015-01-07 | Paper |
| On the Existence of Pure Nash Equilibria in Weighted Congestion Games | 2014-10-21 | Paper |
| Optimal Cost Sharing for Resource Selection Games | 2014-07-11 | Paper |
| Computing pure Nash and strong equilibria in bottleneck congestion games | 2013-11-11 | Paper |
| Strong equilibria in games with the lexicographical improvement property | 2013-06-26 | Paper |
| Resource Buying Games | 2012-09-25 | Paper |
| The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games | 2012-06-26 | Paper |
| Optimal File Distribution in Peer-to-Peer Networks | 2011-12-16 | Paper |
| Characterizing the existence of potential functions in weighted congestion games | 2011-11-23 | Paper |
| Stackelberg strategies and collusion in network games with splittable flow | 2011-05-25 | Paper |
| Stackelberg Routing in Arbitrary Networks | 2011-04-27 | Paper |
| On the Existence of Pure Nash Equilibria in Weighted Congestion Games | 2010-09-07 | Paper |
| Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games | 2010-09-06 | Paper |
| Characterizing the Existence of Potential Functions in Weighted Congestion Games | 2009-12-01 | Paper |
| Competitive online multicommodity routing | 2009-09-02 | Paper |
| Stackelberg Strategies and Collusion in Network Games with Splittable Flow | 2009-02-12 | Paper |
| Congestion control in utility fair networks | 2009-01-20 | Paper |
| Nonadaptive Selfish Routing with Online Demands | 2008-04-15 | Paper |
| Competitive Online Multicommodity Routing | 2008-02-21 | Paper |
