Nick Gravin

According to our database1, Nick Gravin authored at least 47 papers between 2009 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
A Simple Mechanism for a Budget-Constrained Buyer.
ACM Trans. Economics and Comput., 2021

Concentration bounds for almost <i>k</i>-wise independence with applications to non-uniform security.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Online Stochastic Matching with Edge Arrivals.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Optimal Budget-Feasible Mechanisms for Additive Valuations.
ACM Trans. Economics and Comput., 2020

Simultaneous auctions without complements are (almost) efficient.
Games Econ. Behav., 2020

Secretary Matching with General Arrivals.
CoRR, 2020

Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019
Correlation-Robust Analysis of Single Item Auction.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Prophet Inequality for Bipartite Matching: Merits of Being Simple and Non Adaptive.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Correlation-robust mechanism design.
SIGecom Exch., 2018

Monopoly pricing with buyer search.
CoRR, 2018

Separation in Correlation-Robust Monopolist Problem with Budget.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Testing Symmetric Markov Chains From a Single Trajectory.
Proceedings of the Conference On Learning Theory, 2018

2017
Worst-Case Mechanism Design via Bayesian Analysis.
SIAM J. Comput., 2017

Testing from One Sample: Is the casino really using a riffle shuffle?
CoRR, 2017

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games.
Algorithmica, 2017

Liquid Price of Anarchy.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Tight Lower Bounds for Multiplicative Weights Algorithmic Families.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Combinatorial Walrasian Equilibrium.
SIAM J. Comput., 2016

Towards Optimal Algorithms for Prediction with Expert Advice.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Procrastination with Variable Present Bias.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.
ACM Trans. Economics and Comput., 2015

Dynamics of Profit-Sharing Games.
Internet Math., 2015

On Welfare Approximation and Stable Pricing.
CoRR, 2015

Combinatorial Auctions via Posted Prices.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Competitive Analysis via Benchmark Decomposition.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
Truthful Generalized Assignments via Stable Matching.
Math. Oper. Res., 2014

Optimal competitive auctions.
Proceedings of the Symposium on Theory of Computing, 2014

2013
Structure Results for Multiple Tilings in 3D.
Discret. Comput. Geom., 2013

Simultaneous auctions are (almost) efficient.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Competitive Auctions for Markets with Positive Externalities.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Computing approximate pure Nash equilibria in congestion games.
SIGecom Exch., 2012

The Inverse Moment Problem for Convex Polytopes.
Discret. Comput. Geom., 2012

Translational tilings by a polytope, with multiplicity.
Comb., 2012

Budget feasible mechanism design: from prior-free to bayesian.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011
A note on <i>k</i>-shortest paths problem.
J. Graph Theory, 2011

Budget Feasible Mechanism Design via Random Sampling
CoRR, 2011

Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions
CoRR, 2011

Mechanism Design without Money via Stable Matching
CoRR, 2011

Efficient computation of approximate pure Nash equilibria
CoRR, 2011

On the Approximability of Budget Feasible Mechanisms.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
On the Continuous CNN Problem.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Frugal Mechanism Design via Spectral Techniques.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Time Optimal <i>d</i>-List Colouring of a Graph.
Proceedings of the Computer Science, 2010

2009
Refining the Cost of Cheap Labor in Set System Auctions.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009


  Loading...