| Publication | Date of Publication | Type |
|---|
| Reduction of Potential-Based Flow Networks | 2024-03-01 | Paper |
| Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows | 2024-02-27 | Paper |
| The polyhedral geometry of truthful auctions | 2023-11-09 | Paper |
| Optimal impartial correspondences | 2023-08-04 | Paper |
| Generalized Permutahedra and Optimal Auctions | 2023-04-11 | Paper |
| Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium | 2023-03-15 | Paper |
| On the robustness of potential-based flow networks | 2023-03-14 | Paper |
| Equilibria in Multiclass and Multidimensional Atomic Congestion Games | 2023-01-09 | Paper |
| Fractionally subadditive maximization under an incremental knapsack constraint | 2022-10-19 | Paper |
| Packing Under Convex Quadratic Constraints | 2022-10-14 | Paper |
| Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs | 2022-05-17 | Paper |
| Packing under convex quadratic constraints | 2022-03-22 | Paper |
| Pure Nash Equilibria in Resource Graph Games | 2022-02-07 | Paper |
| Generalized permutahedra and optimal auctions | 2021-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002840 | 2021-07-28 | Paper |
| Fractionally Subadditive Maximization under an Incremental Knapsack Constraint | 2021-06-28 | Paper |
| Distance-Preserving Graph Contractions | 2021-06-15 | Paper |
| Nobel, Milgrom and Wilson | 2021-06-11 | Paper |
| Travelling on graphs with small highway dimension | 2021-04-19 | Paper |
| Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians | 2021-02-02 | Paper |
| Hiring Secretaries over Time: The Benefit of Concurrent Employment | 2020-04-30 | Paper |
| Broadcasting a file in a communication network | 2020-04-22 | Paper |
| Travelling on graphs with small highway dimension | 2020-02-24 | Paper |
| Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents | 2020-02-11 | Paper |
| Greedy metric minimum online matchings with random arrivals | 2020-02-10 | Paper |
| The online best reply algorithm for resource allocation problems | 2020-02-04 | Paper |
| Computing all Wardrop Equilibria parametrized by the Flow Demand | 2019-10-15 | Paper |
| Distance-Preserving Graph Contractions | 2019-09-06 | Paper |
| Bottleneck routing with elastic demands | 2019-06-11 | Paper |
| Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids | 2018-08-21 | Paper |
| Undirected Graph Exploration with ⊝(log log n) Pebbles | 2018-07-16 | Paper |
| Computing network tolls with support constraints | 2018-05-23 | Paper |
| Complexity and Approximation of the Continuous Network Design Problem | 2017-08-16 | Paper |
| Packing a Knapsack of Unknown Capacity | 2017-07-14 | Paper |
| Complexity and Approximation of the Continuous Network Design Problem | 2017-03-22 | Paper |
| Approximate Pure Nash Equilibria in Weighted Congestion Games | 2017-03-22 | Paper |
| Packing a Knapsack of Unknown Capacity | 2017-03-03 | Paper |
| Efficiency of Equilibria in Uniform Matroid Congestion Games | 2016-09-29 | Paper |
| Congestion Games with Variable Demands | 2016-04-15 | Paper |
| Impartial Selection and the Power of up to Two Choices | 2016-01-08 | Paper |
| Bottleneck Routing with Elastic Demands | 2016-01-08 | Paper |
| Equilibria in a class of aggregative location games | 2015-12-18 | Paper |
| Optimal Impartial Selection | 2015-11-04 | Paper |
| Scheduling Bidirectional Traffic on a Path | 2015-10-27 | Paper |
| Sharing Non-anonymous Costs of Multiple Resources Optimally | 2015-09-21 | Paper |
| Multimarket Oligopolies with Restricted Market Access | 2015-01-14 | Paper |
| Resource Competition on Integral Polymatroids | 2015-01-07 | Paper |
| Congestion Games with Higher Demand Dimensions | 2015-01-07 | Paper |
| Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games | 2014-12-02 | Paper |
| On the Existence of Pure Nash Equilibria in Weighted Congestion Games | 2014-10-21 | Paper |
| Computing pure Nash and strong equilibria in bottleneck congestion games | 2013-11-11 | Paper |
| Congestion Games with Player-Specific Costs Revisited | 2013-10-23 | Paper |
| Strong equilibria in games with the lexicographical improvement property | 2013-06-26 | Paper |
| Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games | 2013-06-07 | 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 |
| 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 |
