| Publication | Date of Publication | Type |
|---|
| In congestion games, taxes achieve optimal approximation | 2024-07-29 | Paper |
| Existence and Complexity of Approximate Equilibria in Weighted Congestion Games | 2024-02-23 | Paper |
| The price of stability of weighted congestion games | 2021-07-28 | Paper |
| Reachability Switching Games | 2021-07-28 | Paper |
| Reachability switching games | 2021-05-25 | Paper |
| Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games | 2020-04-30 | Paper |
| Hiring secretaries over time: the benefit of concurrent employment | 2020-04-30 | Paper |
| Greedy metric minimum online matchings with random arrivals | 2020-02-10 | Paper |
| The price of stability of weighted congestion games | 2019-11-08 | Paper |
| Computing approximate pure Nash equilibria in Shapley value weighted congestion games | 2019-01-30 | Paper |
| Strategic contention resolution with limited feedback | 2018-03-02 | Paper |
| A 3-player protocol preventing persistence in strategic contention with limited feedback | 2018-02-13 | Paper |
| Complexity and approximation of the continuous network design problem | 2017-08-16 | Paper |
| Cost-sharing in generalised selfish routing | 2017-07-21 | Paper |
| Complexity and Approximation of the Continuous Network Design Problem | 2017-03-22 | Paper |
| Learning equilibria of games via payoff queries | 2016-02-19 | Paper |
| Tight bounds for cost-sharing in weighted congestion games | 2015-11-04 | Paper |
| Approximate Pure Nash Equilibria in Social Context Congestion Games | 2015-01-07 | Paper |
| Bounding the potential function in congestion games and approximate pure Nash equilibria | 2015-01-07 | Paper |
| Routing (un-) splittable flow in games with player-specific affine latency functions | 2014-09-09 | Paper |
| Quasirandom load balancing | 2014-05-22 | Paper |
| Congestion games with player-specific costs revisited | 2013-10-23 | Paper |
| Price of stability in polynomial congestion games | 2013-08-07 | Paper |
| Quasirandom load balancing | 2012-11-29 | Paper |
| Exact price of anarchy for polynomial congestion games | 2012-02-11 | Paper |
| Computing Stable Outcomes in Hedonic Games | 2010-10-19 | Paper |
| Computing Nash equilibria for scheduling on restricted parallel links | 2010-10-06 | Paper |
| Weighted congestion games: price of anarchy, universal worst-case examples, and tightness | 2010-09-06 | Paper |
| Computing Nash equilibria for scheduling on restricted parallel links | 2010-08-15 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395978 | 2009-09-15 | Paper |
| Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions | 2009-03-12 | Paper |
| Malicious Bayesian Congestion Games | 2009-02-12 | Paper |
| Nash equilibria in discrete routing games with convex latency functions | 2008-11-19 | Paper |
| Exact Price of Anarchy for Polynomial Congestion Games | 2008-03-19 | Paper |
| Selfish routing with incomplete information | 2008-02-18 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| A faster combinatorial approximation algorithm for scheduling unrelated parallel machines | 2007-07-16 | Paper |
| The price of anarchy for polynomial social cost | 2007-01-09 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Structure and complexity of extreme Nash equilibria | 2005-10-26 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668737 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826110 | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457216 | 2004-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449200 | 2004-02-08 | Paper |
