Eric Neyman

According to our database, Eric Neyman authored at least 9 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Formalizing the presumption of independence.

Paul Christiano, Eric Neyman, Mark Xu

CoRR, 2022

No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling.

Eric Neyman, Tim Roughgarden

CoRR, 2022

Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals.

Eric Neyman, Tim Roughgarden

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Strictly Proper Contract Functions Can Be Arbitrage-Free.

Eric Neyman, Tim Roughgarden

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Agreement Implies Accuracy for Substitutable Signals.

Rafael M. Frongillo, Eric Neyman, Bo Waggoner

CoRR, 2021

From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation.

Eric Neyman, Tim Roughgarden

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Binary Scoring Rules that Incentivize Precision.

Eric Neyman, Georgy Noarov, S. Matthew Weinberg

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2019

Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers.

Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions.

Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg

CoRR, 2018