# Nick Gravin

According to our database

Collaborative distances:

^{1}, 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

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

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

ACM Trans. Economics and Comput., 2020

Games Econ. Behav., 2020

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

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

SIGecom Exch., 2018

CoRR, 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Proceedings of the Conference On Learning Theory, 2018

2017

SIAM J. Comput., 2017

CoRR, 2017

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

Algorithmica, 2017

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

SIAM J. Comput., 2016

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

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

Internet Math., 2015

CoRR, 2015

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014

Math. Oper. Res., 2014

Proceedings of the Symposium on Theory of Computing, 2014

2013

Discret. Comput. Geom., 2013

Proceedings of the Symposium on Theory of Computing Conference, 2013

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

SIGecom Exch., 2012

Discret. Comput. Geom., 2012

Comb., 2012

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

J. Graph Theory, 2011

CoRR, 2011

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

CoRR, 2011

CoRR, 2011

CoRR, 2011

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Proceedings of the Computer Science, 2010

2009

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009