Eric Neyman
eric.neyman [at] columbia [dot] edu
I am a third-year PhD student in theoretical computer science at Columbia University. I am fortunate to be advised by Tim Roughgarden. My primary interest lies in designing mechanisms for the elicitation and aggregation of forecasts and knowledge, though I am broadly interested in algorithmic game theory, mechanism design, and other areas of theoretical computer science.
Before joining Columbia, I finished an undergraduate degree in math at Princeton University. I was fortunate to work with Matt Weinberg on algorithmic game theory and Gillat Kol on complexity theory.
Links:
My CV
Unexpected Values (my blog on math, philosophy, statistics, politics, and other things I find interesting)
Papers and publications:
Rafael Frongillo, Eric Neyman, Bo Waggoner
In ACM Conference on Economics and Computation (EC), 2023
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals (slides PDF; video of talk)
Eric Neyman, Tim Roughgarden
In ACM Conference on Economics and Computation (EC), 2022
Paul Christiano, Eric Neyman, Mark Xu
Eric Neyman, Tim Roughgarden
In Operations Research and ACM Conference on Economics and Computation (EC), 2021
Eric Neyman, Tim Roughgarden
Eric Neyman, Georgy Noarov, S. Matthew Weinberg
In ACM Conference on Economics and Computation (EC), 2021
Eric Neyman, Tim Roughgarden
In AAAI Conference on Artificial Intelligence (AAAI), 2022
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers (conference version; slides PDF; video of talk)
Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg
In Proceedings of the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2019.
Liljana Babinkostova, Jackson Bahr, Yujin Kim, Eric Neyman, Gregory Taylor
In Journal of Number Theory, Vol. 201 (2019).
Jackson Bahr, Yujin Kim, Eric Neyman, Gregory Taylor
In Rose-Hulman Undergraduate Mathematics Journal, Vol. 19: Iss. 1 (2018).
Eric Neyman, 2015