| Publication | Date of Publication | Type |
|---|
| Communication complexity of discrete fair division | 2025-01-14 | Paper |
| Byzantine generals in the permissionless setting | 2024-07-17 | Paper |
| Complexity-approximation trade-offs in exchange mechanisms: AMMs vs. LOBs | 2024-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126242 | 2024-04-09 | Paper |
| From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation | 2024-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875637 | 2023-02-03 | Paper |
| Algorithms illuminated | 2022-10-03 | Paper |
| Ignore the extra zeroes: variance-optimal mining pools | 2022-06-22 | Paper |
| Introduction | 2022-02-04 | Paper |
| Resource Augmentation | 2022-02-04 | Paper |
| Distribution-Free Models of Social Networks | 2022-02-04 | Paper |
| Distributional Analysis | 2022-02-04 | Paper |
| The idemetric property: when most distances are (almost) the same | 2021-10-29 | Paper |
| When are welfare guarantees robust? | 2021-07-28 | Paper |
| Finding cliques in social networks: a new distribution-free model | 2021-07-28 | Paper |
| The complexity of contracts | 2021-03-24 | Paper |
| The Complexity of Contracts | 2021-02-02 | Paper |
| Robust auctions for revenue via enhanced competition | 2021-01-08 | Paper |
| Complexity theory, game theory, and economics: the Barbados lectures | 2020-11-12 | Paper |
| Prior-free multi-unit auctions with ordered bidders | 2020-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4969210 | 2020-10-05 | Paper |
| Pricing multi-unit markets | 2020-06-18 | Paper |
| Finding cliques in social networks: a new distribution-free model | 2020-05-28 | Paper |
| Stability and recovery for independence systems | 2020-05-27 | Paper |
| Almost envy-freeness with general valuations | 2020-04-22 | Paper |
| Communication complexity of discrete fair division | 2019-10-15 | Paper |
| Sketching valuation functions | 2019-05-10 | Paper |
| Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) | 2019-02-25 | Paper |
| Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding | 2018-08-02 | Paper |
| Intrinsic robustness of the price of anarchy | 2018-08-02 | Paper |
| Is Shapley cost sharing optimal? | 2018-07-12 | Paper |
| Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization | 2018-05-23 | Paper |
| Making the Most of Your Samples | 2018-05-18 | Paper |
| The complexity of the \texttt{k-means} method | 2018-03-02 | Paper |
| The performance of deferred-acceptance auctions | 2017-12-07 | Paper |
| Modularity and greed in double auctions | 2017-10-24 | Paper |
| Local smoothness and the price of anarchy in atomic splittable congestion games | 2017-09-29 | Paper |
| Welfare guarantees for combinatorial auctions with item bidding | 2017-09-29 | Paper |
| The price of anarchy in large games | 2017-09-29 | Paper |
| A PAC Approach to Application-Specific Algorithm Selection | 2017-06-28 | Paper |
| The Price of Anarchy in Auctions | 2017-06-08 | Paper |
| Decompositions of triangle-dense graphs | 2017-05-19 | Paper |
| Generalized Efficiency Bounds in Distributed Resource Allocation | 2017-05-16 | Paper |
| Optimal cost-sharing in general resource selection games | 2017-01-26 | Paper |
| Private matchings and allocations | 2016-11-15 | Paper |
| Twenty lectures on algorithmic game theory | 2016-07-27 | Paper |
| Communication complexity (for algorithm designers) | 2016-07-11 | Paper |
| A PAC approach to application-specific algorithm selection | 2016-04-15 | Paper |
| Decompositions of triangle-dense graphs | 2016-03-23 | Paper |
| Quantifying inefficiency in cost-sharing mechanisms | 2015-11-11 | Paper |
| How bad is selfish routing? | 2015-10-30 | Paper |
| Preventing unraveling in social networks: the anchored \(k\)-core problem | 2015-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501360 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501276 | 2015-08-03 | Paper |
| The sample complexity of revenue maximization | 2015-06-26 | Paper |
| Private matchings and allocations | 2015-06-26 | Paper |
| Revenue maximization with a single sample | 2015-06-08 | Paper |
| Stackelberg scheduling strategies | 2015-02-27 | Paper |
| Local smoothness and the price of anarchy in splittable congestion games | 2015-02-13 | Paper |
| Intrinsic robustness of the price of anarchy | 2015-02-04 | Paper |
| Network cost-sharing without anonymity | 2015-01-14 | Paper |
| Optimal cost-sharing in weighted congestion games | 2015-01-07 | Paper |
| New trade-offs in cost-sharing mechanisms | 2014-11-25 | Paper |
| Selfish routing with atomic players | 2014-10-13 | Paper |
| Computing equilibria in multi-player games | 2014-10-13 | Paper |
| Interactive privacy via the median mechanism | 2014-08-13 | Paper |
| Privately solving linear programs | 2014-07-01 | Paper |
| From convex optimization to randomized mechanisms | 2014-06-05 | Paper |
| Black-box randomized reductions in algorithmic mechanism design | 2014-06-04 | Paper |
| Prior-free auctions with ordered bidders | 2014-05-13 | Paper |
| Bottleneck links, variable demand, and the tragedy of the commons | 2013-08-06 | Paper |
| Preventing unraveling in social networks: the anchored \(k\)-core problem | 2012-11-01 | Paper |
| Revenue submodularity | 2012-09-27 | Paper |
| Stronger bounds on Braess's paradox and the maximum latency of selfish routing | 2012-03-15 | Paper |
| Truthful approximation schemes for single-parameter agents | 2011-10-18 | Paper |
| Restoring Pure Equilibria to Weighted Congestion Games | 2011-07-07 | Paper |
| Metric clustering via consistent labeling | 2011-05-24 | Paper |
| Fully distributed algorithms for convex optimization problems | 2011-03-21 | Paper |
| Braess's Paradox in large random graphs | 2010-12-14 | Paper |
| Designing network protocols for good equilibria | 2010-11-04 | Paper |
| Weighted congestion games: price of anarchy, universal worst-case examples, and tightness | 2010-09-06 | Paper |
| Simpler and better approximation algorithms for network design | 2010-08-16 | Paper |
| Pricing network edges for heterogeneous selfish users | 2010-08-16 | Paper |
| Bottleneck links, variable demand, and the tragedy of the commons | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579454 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579410 | 2010-08-06 | Paper |
| The price of anarchy is independent of the network topology | 2010-08-05 | Paper |
| Computing equilibria: a computational complexity perspective | 2010-02-19 | Paper |
| Network design with weighted players | 2009-10-19 | Paper |
| Beyond Moulin mechanisms | 2009-08-27 | Paper |
| The Price of Stability for Network Design with Fair Cost Allocation | 2009-08-20 | Paper |
| Worst-Case Efficiency Analysis of Queueing Disciplines | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549687 | 2009-01-05 | Paper |
| Computing correlated equilibria in multi-player games | 2008-12-21 | Paper |
| Approximation via cost sharing | 2008-12-21 | Paper |
| Routing games | 2008-09-12 | Paper |
| Introduction to the inefficiency of equilibria | 2008-09-12 | Paper |
| Fully Distributed Algorithms for Convex Optimization Problems | 2008-09-02 | Paper |
| Bertrand Competition in Networks | 2008-05-02 | Paper |
| Is Shapley Cost Sharing Optimal? | 2008-05-02 | Paper |
| Optimal Efficiency Guarantees for Network Design Mechanisms | 2007-11-29 | Paper |
| The price of anarchy in an exponential multi-server | 2007-10-30 | Paper |
| Single-Source Stochastic Routing | 2007-08-28 | Paper |
| Potential functions and the inefficiency of equilibria | 2006-09-26 | Paper |
| On the severity of Braess's paradox: designing networks for selfish users is hard | 2006-07-12 | Paper |
| How much can taxes help selfish routing? | 2006-06-30 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Stackelberg Scheduling Strategies | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828932 | 2004-11-29 | Paper |
| The price of anarchy is independent of the network topology | 2004-11-18 | Paper |
| Bounding the inefficiency of equilibria in nonatomic congestion games | 2004-10-28 | Paper |
| Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation | 2004-10-05 | Paper |
| On a game in directed graphs. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537735 | 2002-06-20 | Paper |
