| 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
ACM Transactions on Algorithms | 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
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Prior-free multi-unit auctions with ordered bidders
Theoretical Computer Science | 2020-11-06 | Paper |
Online market intermediation
| 2020-05-27 | Paper |
scientific article; zbMATH DE number 7204466 (Why is no real title available?)
| 2020-05-27 | Paper |
The online \(k\)-taxi problem
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
The anarchy of scheduling without money
Theoretical Computer Science | 2019-06-06 | Paper |
Beyond myopic best response (in Cournot competition)
| 2019-05-10 | Paper |
Beyond myopic best response (in Cournot competition)
Games and Economic Behavior | 2019-03-29 | Paper |
Online trading as a secretary problem
| 2018-11-08 | Paper |
Selling two goods optimally
Information and Computation | 2018-06-14 | Paper |
Duality and optimality of auctions for uniform distributions
SIAM Journal on Computing | 2018-02-06 | Paper |
Carpooling in social networks
| 2017-12-19 | Paper |
Scheduling without payments
Theory of Computing Systems | 2017-11-07 | Paper |
Approaching utopia, strong truthfulness and externality-resistant mechanisms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
The anarchy of scheduling without money
Algorithmic Game Theory | 2016-09-29 | Paper |
Revenue maximization for market intermediation with correlated priors
Algorithmic Game Theory | 2016-09-29 | Paper |
On the \(k\)-server conjecture
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Selling two goods optimally
Lecture Notes in Computer Science | 2015-11-04 | Paper |
On a model of indexability and its bounds for range queries
Journal of the ACM | 2015-10-30 | Paper |
scientific article; zbMATH DE number 6469200 (Why is no real title available?)
| 2015-08-03 | Paper |
A lower bound for scheduling mechanisms
| 2014-12-18 | Paper |
Competitive analysis of maintaining frequent items of a stream
Theoretical Computer Science | 2014-12-02 | Paper |
Mechanism design for fractional scheduling on unrelated machines
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Worst-case equilibria
Computer Science Review | 2014-10-07 | Paper |
The \(k\)-server problem
Computer Science Review | 2014-10-07 | Paper |
A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
Algorithmica | 2013-05-16 | Paper |
Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
Algorithmica | 2013-04-03 | Paper |
Contention issues in congestion games
Automata, Languages, and Programming | 2012-11-01 | Paper |
Competitive Analysis of Maintaining Frequent Items of a Stream
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Scheduling without payments
Algorithmic Game Theory | 2011-10-28 | Paper |
On the performance of approximate equilibria in congestion games
Algorithmica | 2011-08-16 | Paper |
Recent developments in the mechanism design problem for scheduling
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the Performance of Approximate Equilibria in Congestion Games
Lecture Notes in Computer Science | 2009-10-29 | Paper |
A lower bound for scheduling mechanisms
Algorithmica | 2009-10-23 | Paper |
scientific article; zbMATH DE number 5604092 (Why is no real title available?)
| 2009-09-15 | Paper |
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science | 2009-08-21 | Paper |
Coordination mechanisms
Theoretical Computer Science | 2009-08-21 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Competitive Analysis of Aggregate Max in Windowed Streaming
Automata, Languages and Programming | 2009-07-14 | Paper |
A Characterization of 2-Player Mechanisms for Scheduling
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Selfish Load Balancing Under Partial Knowledge
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Mechanism Design for Fractional Scheduling on Unrelated Machines
Automata, Languages and Programming | 2007-11-28 | Paper |
Worst-case equilibria
| 2006-11-21 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
scientific article; zbMATH DE number 2156269 (Why is no real title available?)
| 2005-04-15 | Paper |
Approximate equilibria and ball fusion
Theory of Computing Systems | 2005-02-11 | Paper |
On the competitive ratio of the work function algorithm for the \(k\)-server problem
Theoretical Computer Science | 2004-11-23 | Paper |
The CNN problem and other \(k\)-server variants
Theoretical Computer Science | 2004-11-23 | Paper |
scientific article; zbMATH DE number 2102754 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2086616 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086615 (Why is no real title available?)
| 2004-08-11 | Paper |
More on randomized on-line algorithms for caching.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1500545 (Why is no real title available?)
| 2001-06-13 | Paper |
scientific article; zbMATH DE number 1500547 (Why is no real title available?)
| 2001-06-13 | Paper |
Beyond Competitive Analysis
SIAM Journal on Computing | 2000-10-18 | Paper |
scientific article; zbMATH DE number 1306896 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1305452 (Why is no real title available?)
| 1999-06-17 | Paper |
Three-Processor Tasks Are Undecidable
SIAM Journal on Computing | 1999-02-22 | Paper |
On the k -server conjecture
Journal of the ACM | 1998-01-28 | Paper |
The 2-evader problem
Information Processing Letters | 1997-02-27 | Paper |
scientific article; zbMATH DE number 437571 (Why is no real title available?)
| 1994-11-29 | Paper |
On the Optimal Bisection of a Polygon
ORSA Journal on Computing | 1993-02-25 | Paper |
On the greedy algorithm for satisfiability
Information Processing Letters | 1993-01-16 | Paper |
Improvements on Khrapchenko's theorem
Theoretical Computer Science | 1993-01-01 | Paper |
