Eric Neyman

Orcid: 0000-0002-6848-8802

According to our database1, Eric Neyman authored at least 11 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Towards a Law of Iterated Expectations for Heuristic Estimators.
CoRR, 2024

Algorithmic Bayesian Epistemology.
CoRR, 2024

2023
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation.
Oper. Res., 2023

Agreement Implies Accuracy for Substitutable Signals.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Formalizing the presumption of independence.
CoRR, 2022

Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals.
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.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Binary Scoring Rules that Incentivize Precision.
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.
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.
CoRR, 2018


  Loading...