Proper Scoring Rules and Domination
Alexander Pruss

TL;DR
This paper extends a theorem on proper scoring rules and domination to include non-additive scoring rules, broadening the theoretical understanding of scoring rule properties.
Contribution
It generalizes a previous theorem to cover non-additive scoring rules, enhancing the theoretical framework of proper scoring rules.
Findings
Generalized the theorem of Predd et al. to non-additive scoring rules.
Provided a broader theoretical foundation for scoring rule analysis.
Enhanced understanding of domination in scoring rule contexts.
Abstract
I generalize a theorem of Predd, et al.~(2009) on domination and strictly proper scoring rules to the case of non-additive scoring rules.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
