default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Neyman
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Eric Neyman:
Algorithmic Bayesian Epistemology. CoRR abs/2403.07949 (2024)- [i9]Paul F. Christiano, Jacob Hilton, Andrea Lincoln, Eric Neyman, Mark Xu:
Towards a Law of Iterated Expectations for Heuristic Estimators. CoRR abs/2410.01290 (2024) - 2023
- [j1]Eric Neyman
, Tim Roughgarden:
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. Oper. Res. 71(6): 2175-2195 (2023) - [c7]Eric Neyman, Tim Roughgarden:
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling. NeurIPS 2023 - [c6]Rafael M. Frongillo, Eric Neyman, Bo Waggoner:
Agreement Implies Accuracy for Substitutable Signals. EC 2023: 702-733 - 2022
- [c5]Eric Neyman, Tim Roughgarden:
Strictly Proper Contract Functions Can Be Arbitrage-Free. AAAI 2022: 5150-5155 - [c4]Eric Neyman, Tim Roughgarden:
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals. EC 2022: 990-1012 - [i8]Eric Neyman, Tim Roughgarden:
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling. CoRR abs/2202.11219 (2022) - [i7]Paul F. Christiano, Eric Neyman, Mark Xu:
Formalizing the presumption of independence. CoRR abs/2211.06738 (2022) - 2021
- [c3]Eric Neyman, Georgy Noarov, S. Matthew Weinberg:
Binary Scoring Rules that Incentivize Precision. EC 2021: 718-733 - [c2]Eric Neyman, Tim Roughgarden:
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. EC 2021: 734 - [i6]Eric Neyman, Tim Roughgarden:
From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation. CoRR abs/2102.07081 (2021) - [i5]Eric Neyman, Tim Roughgarden:
Strictly Proper Contract Functions Can Be Arbitrage-Free. CoRR abs/2109.01308 (2021) - [i4]Eric Neyman, Tim Roughgarden:
Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals. CoRR abs/2111.03153 (2021) - [i3]Rafael M. Frongillo, Eric Neyman, Bo Waggoner:
Agreement Implies Accuracy for Substitutable Signals. CoRR abs/2111.03278 (2021) - 2020
- [i2]Eric Neyman, Georgy Noarov, S. Matthew Weinberg:
Binary Scoring Rules that Incentivize Precision. CoRR abs/2002.10669 (2020)
2010 – 2019
- 2019
- [c1]Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg:
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. FOCS 2019: 249-272 - 2018
- [i1]Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg:
Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions. CoRR abs/1811.09871 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
