This paper investigates the question of how subjective probability should relate to binary belief... more This paper investigates the question of how subjective probability should relate to binary belief. We propose new distance minimization methods, and develop epistemic decisiontheoretic accounts. Both approaches can be shown to get "close" to the truth: the first one by getting "close" to a given probability, and the second by getting expectedly "close" to the truth. More specifically, we study distance minimization with a refined notion of Bregman divergence and expected utility maximization with strict proper scores. Our main results reveal that the two ways to get "close" to the truth can coincide.
Electronic proceedings in theoretical computer science, Jul 11, 2023
Binarizing belief aggregation addresses how to rationally aggregate individual probabilistic beli... more Binarizing belief aggregation addresses how to rationally aggregate individual probabilistic beliefs into collective binary beliefs. Similar to the development of judgment aggregation theory, formulating axiomatic requirements, proving impossibility theorems, and identifying exact agenda conditions of impossibility theorems are natural and important research topics in binarizing belief aggregation. Building on our previous research on impossibility theorems, we use an agenda-theoretic approach to generalize the results and to determine the necessary and sufficient level of logical interconnection between the issues in an agenda for the impossibility theorems to arise. We demonstrate that (1) path-connectedness and even-negatability constitute the exact agenda condition for the oligarchy result stating that binarizing belief aggregation satisfying proposition-wise independence and deductive closure of collective beliefs yields the oligarchies under minor conditions; (2) negationconnectedness is the condition for the triviality result obtained by adding anonymity to the oligarchy result; and (3) blockedness is the condition for the impossibility result, which follows by adding completeness and consistency of collective beliefs. Moreover, we compare these novel findings with existing agenda-theoretic characterization theorems in judgment aggregation and belief binarization.
This paper investigates the question of how subjective probability should relate to binary belief... more This paper investigates the question of how subjective probability should relate to binary belief. We propose new distance minimization methods, and develop epistemic decisiontheoretic accounts. Both approaches can be shown to get "close" to the truth: the first one by getting "close" to a given probability, and the second by getting expectedly "close" to the truth. More specifically, we study distance minimization with a refined notion of Bregman divergence and expected utility maximization with strict proper scores. Our main results reveal that the two ways to get "close" to the truth can coincide.
Electronic proceedings in theoretical computer science, Jul 11, 2023
Binarizing belief aggregation addresses how to rationally aggregate individual probabilistic beli... more Binarizing belief aggregation addresses how to rationally aggregate individual probabilistic beliefs into collective binary beliefs. Similar to the development of judgment aggregation theory, formulating axiomatic requirements, proving impossibility theorems, and identifying exact agenda conditions of impossibility theorems are natural and important research topics in binarizing belief aggregation. Building on our previous research on impossibility theorems, we use an agenda-theoretic approach to generalize the results and to determine the necessary and sufficient level of logical interconnection between the issues in an agenda for the impossibility theorems to arise. We demonstrate that (1) path-connectedness and even-negatability constitute the exact agenda condition for the oligarchy result stating that binarizing belief aggregation satisfying proposition-wise independence and deductive closure of collective beliefs yields the oligarchies under minor conditions; (2) negationconnectedness is the condition for the triviality result obtained by adding anonymity to the oligarchy result; and (3) blockedness is the condition for the impossibility result, which follows by adding completeness and consistency of collective beliefs. Moreover, we compare these novel findings with existing agenda-theoretic characterization theorems in judgment aggregation and belief binarization.
Uploads
Papers by Minkyung Wang