Refining the Cost of Cheap Labor in Set System Auctions. - Ning Chen 005; Edith Elkind; Nick Gravin (WINE, 2009)

Time Optimal d-List Colouring of a Graph. - Nick Gravin (CSR, 2010)

Frugal Mechanism Design via Spectral Techniques. - Ning Chen 005; Edith Elkind; Nick Gravin; Fedor Petrov 001 (FOCS, 2010)

On the Continuous CNN Problem. - John Augustine; Nick Gravin (ISAAC (2), 2010)

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (FOCS, 2011)

On the Approximability of Budget Feasible Mechanisms. - Ning Chen 005; Nick Gravin; Pinyan Lu (SODA, 2011)

Efficient computation of approximate pure Nash equilibria - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (CoRR, 2011)

Mechanism Design without Money via Stable Matching - Ning Chen 005; Nick Gravin; Pinyan Lu (CoRR, 2011)

Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (CoRR, 2011)

Budget Feasible Mechanism Design via Random Sampling - Xiaohui Bei; Ning Chen 005; Nick Gravin; Pinyan Lu (CoRR, 2011)

A note on k-shortest paths problem. - Nick Gravin; Ning Chen 005 (J. Graph Theory, 2011)

Budget feasible mechanism design: from prior-free to bayesian. - Xiaohui Bei; Ning Chen 005; Nick Gravin; Pinyan Lu (STOC, 2012)

Translational tilings by a polytope, with multiplicity. - Nick Gravin; Sinai Robins; Dmitry Shiryaev (Comb., 2012)

The Inverse Moment Problem for Convex Polytopes. - Nick Gravin; Jean B. Lasserre; Dmitrii V. Pasechnik; Sinai Robins (Discret. Comput. Geom., 2012)

Computing approximate pure Nash equilibria in congestion games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (SIGecom Exch., 2012)

Competitive Auctions for Markets with Positive Externalities. - Nick Gravin; Pinyan Lu (ICALP (2), 2013)

Simultaneous auctions are (almost) efficient. - Michal Feldman; Hu Fu 001; Nick Gravin; Brendan Lucier (STOC, 2013)

Structure Results for Multiple Tilings in 3D. - Nick Gravin; Mihail N. Kolountzakis; Sinai Robins; Dmitry Shiryaev (Discret. Comput. Geom., 2013)

Optimal competitive auctions. - Ning Chen 005; Nick Gravin; Pinyan Lu (STOC, 2014)

Truthful Generalized Assignments via Stable Matching. - Ning Chen 005; Nick Gravin; Pinyan Lu (Math. Oper. Res., 2014)

Competitive Analysis via Benchmark Decomposition. - Ning Chen 005; Nikolai Gravin; Pinyan Lu (EC, 2015)

Combinatorial Auctions via Posted Prices. - Michal Feldman; Nick Gravin; Brendan Lucier (SODA, 2015)

On Welfare Approximation and Stable Pricing. - Michal Feldman; Nick Gravin; Brendan Lucier (CoRR, 2015)

Dynamics of Profit-Sharing Games. - John Augustine; Ning Chen 005; Edith Elkind; Angelo Fanelli 001; Nick Gravin; Dmitry Shiryaev (Internet Math., 2015)

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin; Alexander Skopalik (ACM Trans. Economics and Comput., 2015)

Procrastination with Variable Present Bias. - Nick Gravin; Nicole Immorlica; Brendan Lucier; Emmanouil Pountourakis (EC, 2016)

Towards Optimal Algorithms for Prediction with Expert Advice. - Nick Gravin; Yuval Peres; Balasubramanian Sivan (SODA, 2016)

Combinatorial Walrasian Equilibrium. - Michal Feldman; Nick Gravin; Brendan Lucier (SIAM J. Comput., 2016)

Tight Lower Bounds for Multiplicative Weights Algorithmic Families. - Nick Gravin; Yuval Peres; Balasubramanian Sivan (ICALP, 2017)

Liquid Price of Anarchy. - Yossi Azar; Michal Feldman; Nick Gravin; Alan Roytman (SAGT, 2017)

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. - Ioannis Caragiannis; Angelo Fanelli 001; Nick Gravin (Algorithmica, 2017)

Testing from One Sample: Is the casino really using a riffle shuffle? - Constantinos Daskalakis; Nishanth Dikkala; Nick Gravin (CoRR, 2017)

Worst-Case Mechanism Design via Bayesian Analysis. - Xiaohui Bei; Ning Chen 005; Nick Gravin; Pinyan Lu (SIAM J. Comput., 2017)

Testing Symmetric Markov Chains From a Single Trajectory. - Constantinos Daskalakis; Nishanth Dikkala; Nick Gravin (COLT, 2018)

Separation in Correlation-Robust Monopolist Problem with Budget. - Nick Gravin; Pinyan Lu (SODA, 2018)

Monopoly pricing with buyer search. - Nick Gravin; Zhihao Gavin Tang (CoRR, 2018)

Correlation-robust mechanism design. - Nick Gravin; Pinian Lu (SIGecom Exch., 2018)

Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items. - Ioannis Caragiannis; Nick Gravin; Xin Huang (EC, 2019)

Prophet Inequality for Bipartite Matching: Merits of Being Simple and Non Adaptive. - Nikolai Gravin; Hongao Wang (EC, 2019)

Correlation-Robust Analysis of Single Item Auction. - Xiaohui Bei; Nick Gravin; Pinyan Lu; Zhihao Gavin Tang (SODA, 2019)

Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (EC, 2020)

Secretary Matching with General Arrivals. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (CoRR, 2020)

Simultaneous auctions without complements are (almost) efficient. - Michal Feldman; Hu Fu 001; Nick Gravin; Brendan Lucier (Games Econ. Behav., 2020)

Optimal Budget-Feasible Mechanisms for Additive Valuations. - Nick Gravin; Yaonan Jin; Pinyan Lu; Chenhao Zhang 003 (ACM Trans. Economics and Comput., 2020)

Online Stochastic Matching with Edge Arrivals. - Nick Gravin; Zhihao Gavin Tang; Kangning Wang 001 (ICALP, 2021)

Concentration bounds for almost k-wise independence with applications to non-uniform security. - Nick Gravin; Siyao Guo; Tsz Chiu Kwok; Pinyan Lu (SODA, 2021)

Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. - Ioannis Caragiannis; Nick Gravin; Pinyan Lu; Zihe Wang 001 (WINE, 2021)

A Simple Mechanism for a Budget-Constrained Buyer. - Yu Cheng 002; Nick Gravin; Kamesh Munagala; Kangning Wang 001 (ACM Trans. Economics and Comput., 2021)

Lookahead Auctions with Pooling. - Michal Feldman; Nick Gravin; Zhihao Gavin Tang; Almog Wald (SAGT, 2022)

General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (EC, 2022)

Optimal Prophet Inequality with Less than One Sample. - Nick Gravin; Hao Li 107; Zhihao Gavin Tang (WINE, 2022)

On the Significance of Knowing the Arrival Order in Prophet Inequality. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (CoRR, 2022)

The Cardinal Complexity of Comparison-based Online Algorithms. - Nick Gravin; Enze Sun 001; Zhihao Gavin Tang (CoRR, 2022)

Prophet Matching with General Arrivals. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (Math. Oper. Res., 2022)

Introduction to the Special Issue on WINE'20: Part 1. - Martin Hoefer 001; Xujin Chen; Nikolai Gravin; Ruta Mehta (ACM Trans. Economics and Comput., 2022)

Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity. - Nick Gravin; Enze Sun 001; Zhihao Gavin Tang (FOCS, 2023)

Bidder Subset Selection Problem in Auction Design. - Xiaohui Bei; Nick Gravin; Pinyan Lu; Zhihao Gavin Tang (SODA, 2023)

"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 (SODA, 2023)

Online resource allocation in Markov Chains. - Jianhao Jia; Hao Li 107; Kai Liu; Ziqi Liu; Jun Zhou 011; Nikolai Gravin; Zhihao Gavin Tang (WWW, 2023)

Bidder Selection Problem in Position Auctions via Poisson Approximation. - Nick Gravin; Yixuan Even Xu; Renfei Zhou (CoRR, 2023)

Prophet Inequality for Bipartite Matching: Merits of Being Simple and Nonadaptive. - Nick Gravin; Hongao Wang (Math. Oper. Res., 2023)

On Robustness to k-Wise Independence of Optimal Bayesian Mechanisms. - Nick Gravin; Zhiqi Wang (FOCS, 2024)

Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation. - Nikolai Gravin; Yixuan Even Xu; Renfei Zhou (WWW, 2024)

On Robustness to k-wise Independence of Optimal Bayesian Mechanisms. - Nick Gravin; Zhiqi Wang (CoRR, 2024)

Strategic Facility Location via Predictions. - Qingyun Chen; Nick Gravin; Sungjin Im (CoRR, 2024)

On the satisfiability of random 3-SAT formulas with k-wise independent clauses. - Ioannis Caragiannis; Nick Gravin; Zhile Jiang (CoRR, 2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. - Noga Alon; Nick Gravin; Tristan Pollner; Aviad Rubinstein; Hongao Wang; S. Matthew Weinberg; Qianfan Zhang 002 (CoRR, 2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. - Noga Alon; Nick Gravin; Tristan Pollner; Aviad Rubinstein; Hongao Wang; S. Matthew Weinberg; Qianfan Zhang 002 (ITCS, 2025)

Approximation Guarantees of Median Mechanism in ℝᵈ. - Nikolai Gravin; Jianhao Jia (STOC, 2025)

Bayesian and Randomized Clock Auctions. - Michal Feldman; Vasilis Gkatzelis; Nick Gravin; Daniel Schoepflin 001 (Oper. Res., 2025)

Approximation guarantees of Median Mechanism in ℝd. - Nick Gravin; Jianhao Jia (CoRR, 2025)