| Market design job market candidate profiles 2022 | 0 | 0.34 | 2021 |
| Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer | 0 | 0.34 | 2020 |
| Matching for the Israeli: Handling Rich Diversity Requirements | 0 | 0.34 | 2019 |
| A Compact, Logical Approach to Large-Market Analysis. | 0 | 0.34 | 2019 |
| Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets. | 0 | 0.34 | 2019 |
| Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements | 0 | 0.34 | 2019 |
| The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization | 0 | 0.34 | 2018 |
| Bounding the menu-size of approximately optimal auctions via optimal-transport duality | 2 | 0.37 | 2018 |
| Are Two (Samples) Really Better Than One? | 0 | 0.34 | 2018 |
| The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade. | 0 | 0.34 | 2018 |
| Playing on a Level Field: Sincere and Sophisticated Players in the Boston Mechanism with a Coarse Priority Structure. | 0 | 0.34 | 2018 |
| Are Two (Samples) Really Better Than One? On the Non-Asymptotic Performance of Empirical Revenue Maximization. | 0 | 0.34 | 2018 |
| Stable matching mechanisms are not obviously strategy-proof. | 2 | 0.66 | 2018 |
| Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. | 2 | 0.36 | 2017 |
| Efficient Empirical Revenue Maximization in Single-Parameter Auction Environments. | 14 | 0.68 | 2017 |
| Gibbard-Satterthwaite Success Stories and Obvious Strategyproofness. | 4 | 0.53 | 2017 |
| Incentives and gamification. | 0 | 0.34 | 2017 |
| The Menu-Size Complexity of Revenue Approximation. | 8 | 0.47 | 2017 |
| A Hydraulic Approach to Equilibria of Resource Selection Games. | 0 | 0.34 | 2016 |
| Unbeatable Set Consensus via Topological and Combinatorial Reasoning. | 0 | 0.34 | 2016 |
| SIGecom job market candidate profiles 2020 | 0 | 0.34 | 2016 |
| Dating Strategies Are Not Obvious | 0 | 0.34 | 2015 |
| A stable marriage requires communication | 6 | 0.53 | 2015 |
| Unbeatable Consensus. | 0 | 0.34 | 2014 |
| Physical Computation of Nash Equilibrium: 'Hydraulic' Resource Selection. | 1 | 0.40 | 2014 |
| Noncooperative Market Allocation and the Formation of Downtown. | 1 | 0.36 | 2014 |
| Timely Common Knowledge. | 3 | 0.39 | 2013 |
| Manipulation of stable matchings using minimal blacklists | 5 | 0.61 | 2013 |
| Sisterhood in the Gale-Shapley Matching Algorithm. | 5 | 0.76 | 2013 |
| Satisfiability and Canonisation of Timely Constraints | 0 | 0.34 | 2013 |
| Brief announcement: pareto optimal solutions to consensus and set consensus | 5 | 0.46 | 2013 |
| Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus. | 0 | 0.34 | 2013 |
| Timely Coordination in a Multi-Agent System | 2 | 0.41 | 2012 |
