Sotabase

Career

· Researcher, Alignment Research Center
· PhD Student, Columbia University in the City of New York
· Research Assistant, Columbia University in the City of New York

Publications (17)

Binary Scoring Rules that Incentivize Precision
ACM Conference on Economics and Computation · 2020
21
cited
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals
ACM Conference on Economics and Computation · 2021
18
cited
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers
IEEE Annual Symposium on Foundations of Computer Science · 2019
14
cited
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation
ACM Conference on Economics and Computation · 2021
13
cited
Agreement Implies Accuracy for Substitutable Signals
ACM Conference on Economics and Computation · 2021
8
cited
Formalizing the presumption of independence
arXiv.org · 2022
7
cited
Anomalous primes and the elliptic Korselt criterion
Journal of Number Theory · 2016
5
cited
Cylindric Young Tableaux and their Properties
2014
5
cited
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling
Neural Information Processing Systems · 2022
5
cited
Characterizing Finite Fields With Anomalous Elliptic Curves
2017
1
cited
Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions
arXiv.org · 2018
1
cited
Strictly Proper Contract Functions Can Be Arbitrage-Free
AAAI Conference on Artificial Intelligence · 2021
1
cited
Communication Complexity With a Prover: Applications to Fine-Grain Complexity
2019
Getting Money Out of Politics... And Into Charity
2019
PUMaC 2016 Power Round Solutions
2016
Robust forecast aggregation via additional queries
arXiv.org · 2025
Will it Rain Tomorrow? Incentivizing Experts via Binary Scoring Rules
Sotabase
Eric Neyman | Researcher Profile | Sotabase | Sotabase