| Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals | 0 | 0.34 | 2022 |
| From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation | 0 | 0.34 | 2021 |
| Ignore the Extra Zeroes: Variance-Optimal Mining Pools | 0 | 0.34 | 2021 |
| Smoothed Analysis with Adaptive Adversaries | 0 | 0.34 | 2021 |
| Transaction fee mechanism design | 0 | 0.34 | 2021 |
| Robust Auctions for Revenue via Enhanced Competition | 0 | 0.34 | 2020 |
| Data-driven algorithm design | 1 | 0.35 | 2020 |
| How Computer Science Informs Modern Auction Design (Invited Talk). | 0 | 0.34 | 2019 |
| Introduction to the Special Issue – Algorithmic Game Theory – STOC/FOCS/SODA 2011 | 0 | 0.34 | 2019 |
| An Axiomatic Approach to Block Rewards. | 0 | 0.34 | 2019 |
| Beyond Worst-Case Analysis. | 1 | 0.37 | 2019 |
| Communication Complexity of Discrete Fair Division. | 0 | 0.34 | 2019 |
| The idemetric property: when most distances are (almost) the same. | 0 | 0.34 | 2018 |
| FINDING CLIQUES IN SOCIAL NETWORKS: A NEW DISTRIBUTION-FREE MODEL | 1 | 0.36 | 2018 |
| Almost Envy-Freeness with General Valuations. | 9 | 0.60 | 2018 |
| Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. | 1 | 0.35 | 2018 |
| On the Computational Power of Online Gradient Descent. | 0 | 0.34 | 2018 |
| Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation). | 8 | 0.46 | 2018 |
| An Optimal Algorithm for Online Unconstrained Submodular Maximization. | 0 | 0.34 | 2018 |
| Twenty Lectures on Algorithmic Game Theory | 2 | 0.41 | 2017 |
| Online Prediction with Selfish Experts. | 0 | 0.34 | 2017 |
| Approximately Efficient Two-Sided Combinatorial Auctions. | 0 | 0.34 | 2017 |
| The Price of Anarchy in Auctions. | 11 | 0.61 | 2017 |
| Deferred-Acceptance Auctions for Multiple Levels of Service. | 2 | 0.39 | 2017 |
| Stability and Recovery for Independence Systems. | 2 | 0.38 | 2017 |
| Pricing Identical Items. | 0 | 0.34 | 2017 |
| The Complexity of the k-means Method. | 3 | 0.40 | 2016 |
| Optimal and Robust Mechanism Design with Interdependent Values. | 1 | 0.37 | 2016 |
| A PAC Approach to Application-Specific Algorithm Selection. | 3 | 0.40 | 2016 |
| Incentive Compatibility of Bitcoin Mining Pool Reward Functions. | 5 | 0.46 | 2016 |
| Mathematical foundations for social computing. | 1 | 0.35 | 2016 |
| Intrinsic Robustness of the Price of Anarchy: Abstract of the Kalai Prize Talk. | 0 | 0.34 | 2016 |
| Special Section of Games and Economic Behavior dedicated to the 11th and 12th ACM Conference on Electronic Commerce | 0 | 0.34 | 2015 |
| Special Section on the Fifty-Third IEEE Annual Symposium on Foundations of Computer Science (FOCS 2012) | 0 | 0.34 | 2015 |
| Why Prices Need Algorithms | 3 | 0.42 | 2015 |
| Communication Complexity (for Algorithm Designers) | 1 | 0.39 | 2015 |
| The Price of Anarchy in Large Games. | 2 | 0.38 | 2015 |
| Local smoothness and the price of anarchy in splittable congestion games. | 20 | 0.78 | 2015 |
| How Hard is Inference for Structured Prediction? | 5 | 0.40 | 2015 |
| Barriers to Near-Optimal Equilibria | 18 | 0.71 | 2014 |
| Optimal Platform Design. | 1 | 0.40 | 2014 |
| Approximately optimal mechanism design: motivation, examples, and lessons learned | 1 | 0.36 | 2014 |
| Tight Error Bounds for Structured Prediction. | 4 | 0.42 | 2014 |
| The Sample Complexity of Revenue Maximization. | 17 | 0.79 | 2014 |
| Privately Solving Linear Programs. | 10 | 0.58 | 2014 |
| Optimal Cost-Sharing In Weighted Congestion Games | 11 | 0.52 | 2014 |
| Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness | 41 | 1.57 | 2014 |
| The performance of deferred-acceptance auctions | 7 | 0.48 | 2014 |
| Modularity and greed in double auctions | 8 | 0.55 | 2014 |
| Black-Box Randomized Reductions in Algorithmic Mechanism Design | 24 | 1.25 | 2014 |
