Acceptance, Aggregation and Scoring Rules

This article provides a novel perspective on the vexed issue of the relation between probability and rational acceptability, exploiting a recently-noted structural parallel with the problem of judgment aggregation. After oering 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.

Publication year:2013

BOF-keylabel:yes

IOF-keylabel:yes

CSS-citation score:1

Authors from:Higher Education