| Binary scoring rules that incentivize precision E Neyman, G Noarov, SM Weinberg Proceedings of the 22nd ACM Conference on Economics and Computation, 718-733, 2021 | 21 | 2021 |
| Settling the communication complexity of combinatorial auctions with two subadditive buyers T Ezra, M Feldman, E Neyman, I Talgam-Cohen, M Weinberg 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 14 | 2019 |
| Are you smarter than a random expert? The robust aggregation of substitutable signals E Neyman, T Roughgarden Proceedings of the 23rd ACM Conference on Economics and Computation, 990-1012, 2022 | 10 | 2022 |
| From proper scoring rules to max-min optimal forecast aggregation E Neyman, T Roughgarden Operations Research 71 (6), 2175-2195, 2023 | 9 | 2023 |
| Agreement implies accuracy for substitutable signals R Frongillo, E Neyman, B Waggoner Proceedings of the 24th ACM Conference on Economics and Computation, 702-733, 2023 | 6 | 2023 |
| No-regret learning with unbounded losses: The case of logarithmic pooling E Neyman, T Roughgarden Advances in Neural Information Processing Systems 36, 2024 | 5 | 2024 |
| Formalizing the presumption of independence P Christiano, E Neyman, M Xu arXiv preprint arXiv:2211.06738, 2022 | 5 | 2022 |
| Anomalous primes and the elliptic Korselt criterion L Babinkostova, JC Bahr, YH Kim, E Neyman, GK Taylor Journal of Number Theory 201, 108-123, 2019 | 4 | 2019 |
| Strictly proper contract functions can be arbitrage-free E Neyman, T Roughgarden Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5150-5155, 2022 | 1 | 2022 |
| On orders of elliptic curves over finite fields YH Kim, J Bahr, E Neyman, G Taylor Rose-Hulman Undergraduate Mathematics Journal 19 (1), 2, 2018 | 1 | 2018 |
| Algorithmic Bayesian Epistemology E Neyman arXiv preprint arXiv:2403.07949, 2024 | | 2024 |
| Characterizing Finite Fields With Anomalous Elliptic Curves JC Bahr, YH Kim, GK Taylor, EM Neyman | | 2017 |
