| Combinatorial auctions via posted prices M Feldman, N Gravin, B Lucier Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 238 | 2014 |
| Simultaneous auctions are (almost) efficient M Feldman, H Fu, N Gravin, B Lucier Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 160 | 2013 |
| On the approximability of budget feasible mechanisms N Chen, N Gravin, P Lu Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 141 | 2011 |
| Envy-freeness up to any item with high Nash welfare: The virtue of donating items I Caragiannis, N Gravin, X Huang Proceedings of the 2019 ACM Conference on Economics and Computation, 527-545, 2019 | 115 | 2019 |
| Budget feasible mechanism design: from prior-free to bayesian X Bei, N Chen, N Gravin, P Lu Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 75 | 2012 |
| The inverse moment problem for convex polytopes N Gravin, J Lasserre, DV Pasechnik, S Robins Discrete & Computational Geometry 48, 596-621, 2012 | 74 | 2012 |
| Online stochastic max-weight matching: Prophet inequality for vertex and edge arrival models T Ezra, M Feldman, N Gravin, ZG Tang Proceedings of the 21st ACM Conference on Economics and Computation, 769-787, 2020 | 73 | 2020 |
| Efficient computation of approximate pure Nash equilibria in congestion games I Caragiannis, A Fanelli, N Gravin, A Skopalik 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 532-541, 2011 | 69 | 2011 |
| Prophet inequality for bipartite matching: Merits of being simple and non adaptive N Gravin, H Wang Proceedings of the 2019 ACM Conference on Economics and Computation, 93-109, 2019 | 62 | 2019 |
| Translational tilings by a polytope, with multiplicity N Gravin, S Robins, D Shiryaev Combinatorica 32, 629-649, 2012 | 62 | 2012 |
| Combinatorial walrasian equilibrium M Feldman, N Gravin, B Lucier Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 57 | 2013 |
| Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure I Caragiannis, A Fanelli, N Gravin, A Skopalik ACM Transactions on Economics and Computation (TEAC) 3 (1), 1-32, 2015 | 54 | 2015 |
| Towards optimal algorithms for prediction with expert advice N Gravin, Y Peres, B Sivan Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 50 | 2016 |
| Optimal competitive auctions N Chen, N Gravin, P Lu Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 43 | 2014 |
| Dynamics of profit-sharing games J Augustine, N Chen, E Elkind, A Fanelli, N Gravin, D Shiryaev Internet Mathematics 11 (1), 1-22, 2015 | 41 | 2015 |
| Correlation-robust analysis of single item auction X Bei, N Gravin, P Lu, ZG Tang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 40 | 2019 |
| Separation in correlation-robust monopolist problem with budget N Gravin, P Lu Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 38 | 2018 |
| Testing symmetric markov chains from a single trajectory C Daskalakis, N Dikkala, N Gravin Conference On Learning Theory, 385-409, 2018 | 35 | 2018 |
| Procrastination with variable present bias N Gravin, N Immorlica, B Lucier, E Pountourakis arXiv preprint arXiv:1606.03062, 2016 | 34 | 2016 |
| Frugal mechanism design via spectral techniques N Chen, E Elkind, N Gravin, F Petrov 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 755-764, 2010 | 31 | 2010 |
