Eric Neyman

According to our database1, Eric Neyman authored at least 8 papers between 2018 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2021
Agreement Implies Accuracy for Substitutable Signals.
CoRR, 2021

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

Strictly Proper Contract Functions Can Be Arbitrage-Free.
CoRR, 2021

From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 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...