Acceptance, Aggregation and Scoring Rules

Erkenntnis 78 (1):201-217 (2013)
Download Edit this record How to cite View on PhilPapers
As the ongoing literature on the paradoxes of the Lottery and the Preface reminds us, the nature of the relation between probability and rational acceptability remains far from settled. This article provides a novel perspective on the matter by exploiting a recently noted structural parallel with the problem of judgment aggregation. After offering a number of general desiderata on the relation between finite probability models and sets of accepted sentences in a Boolean sentential language, it is noted that a number of these constraints will be satisfied if and only if acceptable sentences are true under all valuations in a distinguished non-empty set W. Drawing inspiration from distance-based aggregation procedures, various scoring rule based membership conditions for W are discussed and a possible point of contact with ranking theory is considered. The paper closes with various suggestions for further research.
Reprint years
PhilPapers/Archive ID
Upload history
Archival date: 2011-12-20
View other versions
Added to PP index

Total views
401 ( #15,099 of 2,439,582 )

Recent downloads (6 months)
24 ( #28,886 of 2,439,582 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.