| Publication | Date of Publication | Type |
|---|
| A proof of the Nisan-Ronen conjecture | 2024-05-08 | Paper |
| Better Bounds for Online Line Chasing | 2022-07-21 | Paper |
| Wealth Inequality and the Price of Anarchy | 2022-07-18 | Paper |
| The Infinite Server Problem | 2022-02-16 | Paper |
| Beyond Competitive Analysis | 2022-02-04 | Paper |
| Fairness and efficiency in DAG-based cryptocurrencies | 2021-02-08 | Paper |
| On the Nisan-Ronen conjecture for submodular valuations | 2021-01-19 | Paper |
| Prior-free multi-unit auctions with ordered bidders | 2020-11-06 | Paper |
| Online Market Intermediation | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111343 | 2020-05-27 | Paper |
| The online 𝑘-taxi problem | 2020-01-30 | Paper |
| The anarchy of scheduling without money | 2019-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743453 | 2019-05-10 | Paper |
| Beyond myopic best response (in Cournot competition) | 2019-03-29 | Paper |
| Online trading as a secretary problem | 2018-11-08 | Paper |
| Selling two goods optimally | 2018-06-14 | Paper |
| Duality and Optimality of Auctions for Uniform Distributions | 2018-02-06 | Paper |
| Carpooling in Social Networks | 2017-12-19 | Paper |
| Scheduling without payments | 2017-11-07 | Paper |
| Approaching utopia | 2017-05-16 | Paper |
| The Anarchy of Scheduling Without Money | 2016-09-29 | Paper |
| Revenue Maximization for Market Intermediation with Correlated Priors | 2016-09-29 | Paper |
| On the \(k\)-server conjecture | 2016-09-01 | Paper |
| Selling two goods optimally | 2015-11-04 | Paper |
| On a model of indexability and its bounds for range queries | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501318 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934711 | 2014-12-18 | Paper |
| Competitive analysis of maintaining frequent items of a stream | 2014-12-02 | Paper |
| Mechanism design for fractional scheduling on unrelated machines | 2014-11-18 | Paper |
| Worst-case equilibria | 2014-10-07 | Paper |
| The \(k\)-server problem | 2014-10-07 | Paper |
| A lower bound of \(1+\varphi \) for truthful scheduling mechanisms | 2013-05-16 | Paper |
| Competitive analysis of organization networks or multicast acknowledgment: how much to wait? | 2013-04-03 | Paper |
| Contention Issues in Congestion Games | 2012-11-01 | Paper |
| Competitive Analysis of Maintaining Frequent Items of a Stream | 2012-08-14 | Paper |
| Scheduling without Payments | 2011-10-28 | Paper |
| On the performance of approximate equilibria in congestion games | 2011-08-16 | Paper |
| Recent Developments in the Mechanism Design Problem for Scheduling | 2011-06-03 | Paper |
| The price of anarchy of finite congestion games | 2010-08-16 | Paper |
| On the Performance of Approximate Equilibria in Congestion Games | 2009-10-29 | Paper |
| A lower bound for scheduling mechanisms | 2009-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395975 | 2009-09-15 | Paper |
| The structure and complexity of Nash equilibria for a selfish routing game | 2009-08-21 | Paper |
| Coordination mechanisms | 2009-08-21 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Competitive Analysis of Aggregate Max in Windowed Streaming | 2009-07-14 | Paper |
| A Characterization of 2-Player Mechanisms for Scheduling | 2008-11-25 | Paper |
| Selfish Load Balancing Under Partial Knowledge | 2008-09-17 | Paper |
| A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms | 2008-09-17 | Paper |
| Mechanism Design for Fractional Scheduling on Unrelated Machines | 2007-11-28 | Paper |
| Worst-case equilibria | 2006-11-21 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668727 | 2005-04-15 | Paper |
| Approximate equilibria and ball fusion | 2005-02-11 | Paper |
| On the competitive ratio of the work function algorithm for the \(k\)-server problem | 2004-11-23 | Paper |
| The CNN problem and other \(k\)-server variants | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818841 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737150 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737149 | 2004-08-11 | Paper |
| More on randomized on-line algorithms for caching. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501564 | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501566 | 2001-06-13 | Paper |
| Beyond Competitive Analysis | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252749 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252338 | 1999-06-17 | Paper |
| Three-Processor Tasks Are Undecidable | 1999-02-22 | Paper |
| On the k -server conjecture | 1998-01-28 | Paper |
| The 2-evader problem | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140450 | 1994-11-29 | Paper |
| On the Optimal Bisection of a Polygon | 1993-02-25 | Paper |
| On the greedy algorithm for satisfiability | 1993-01-16 | Paper |
| Improvements on Khrapchenko's theorem | 1993-01-01 | Paper |
