| 2025 | ECAI | Integrality Gap of Nash Welfare Maximization with Money. | Yuriy Dementiev, Nick Gravin, Artur Ignatiev |
| 2025 | ESA | On the Satisfiability of Random 3-SAT Formulas with k-Wise Independent Clauses. | Ioannis Caragiannis, Nick Gravin, Zhile Jiang |
| 2024 | FOCS | On Robustness to k-Wise Independence of Optimal Bayesian Mechanisms. | Nick Gravin, Zhiqi Wang |
| 2023 | FOCS | Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity. | Nick Gravin, Enze Sun, Zhihao Gavin Tang |
| 2023 | SODA | Bidder Subset Selection Problem in Auction Design. | Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang |
| 2023 | SODA | "Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings. | Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang |
| 2022 | SAGT | Lookahead Auctions with Pooling. | Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald |
| 2021 | ICALP | Online Stochastic Matching with Edge Arrivals. | Nick Gravin, Zhihao Gavin Tang, Kangning Wang |
| 2021 | SODA | Concentration bounds for almost | Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu |
| 2019 | EC | Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items. | Ioannis Caragiannis, Nick Gravin, Xin Huang |
| 2019 | EC | Optimal Budget-Feasible Mechanisms for Additive Valuations. | Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang |
| 2019 | SODA | Correlation-Robust Analysis of Single Item Auction. | Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang |
| 2018 | COLT | Testing Symmetric Markov Chains From a Single Trajectory. | Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin |
| 2018 | SODA | Separation in Correlation-Robust Monopolist Problem with Budget. | Nick Gravin, Pinyan Lu |
| 2017 | ICALP | Tight Lower Bounds for Multiplicative Weights Algorithmic Families. | Nick Gravin, Yuval Peres, Balasubramanian Sivan |
| 2017 | SAGT | Liquid Price of Anarchy. | Yossi Azar, Michal Feldman, Nick Gravin, Alan Roytman |
| 2016 | SODA | Towards Optimal Algorithms for Prediction with Expert Advice. | Nick Gravin, Yuval Peres, Balasubramanian Sivan |
| 2015 | SODA | Combinatorial Auctions via Posted Prices. | Michal Feldman, Nick Gravin, Brendan Lucier |
| 2014 | STOC | Optimal competitive auctions. | Ning Chen, Nick Gravin, Pinyan Lu |
| 2014 | SAGT | Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin |
| 2013 | ICALP | Competitive Auctions for Markets with Positive Externalities. | Nick Gravin, Pinyan Lu |
| 2013 | STOC | Simultaneous auctions are (almost) efficient. | Michal Feldman, Hu Fu, Nick Gravin, Brendan Lucier |
| 2013 | STOC | Combinatorial walrasian equilibrium. | Michal Feldman, Nick Gravin, Brendan Lucier |
| 2012 | STOC | Budget feasible mechanism design: from prior-free to bayesian. | Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu |
| 2011 | FOCS | Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik |
| 2011 | IJCAI | Dynamics of Profit-Sharing Games. | John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli, Nick Gravin, Dmitry Shiryaev |
| 2011 | SODA | On the Approximability of Budget Feasible Mechanisms. | Ning Chen, Nick Gravin, Pinyan Lu |
| 2010 | CSR | Time Optimal | Nick Gravin |
| 2010 | FOCS | Frugal Mechanism Design via Spectral Techniques. | Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov |
| 2010 | ISAAC | On the Continuous CNN Problem. | John Augustine, Nick Gravin |