Aggregating Credences into Beliefs: Agenda Conditions for Impossibility Results

• URL: http://arxiv.org/abs/2307.05072v1
• Date: Tue, 11 Jul 2023 07:15:11 GMT
• Title: Aggregating Credences into Beliefs: Agenda Conditions for Impossibility Results
• Abstract summary: We show that path-connectedness and even-negatability constitute the exact agenda condition for the oligarchy result. We compare these novel findings with existing agenda-theoretic characterization theorems in judgment aggregation and belief binarization.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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) negation-connectedness 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.

Related papers

• Revealed Rationality: Label-Free Evaluation and Regularization from Representation Theorems [0.0]
  theorems in decision theory that behavior satisfies certain axioms if and only if it can be rationalized by a well-defined objective.<n>I argue that this if and only if'' structure provides a potentially useful foundation for label-free evaluation and regularization of LLMs and other AI systems.
  arXiv  Detail & Related papers  (2026-08-05T16:21:18Z)
• Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability [46.784084625532984]
  This paper explores unsupervised disentangled representation learning from a functional perspective.<n>We prove that this condition yields identifiability of general nonlinear generative models.
  arXiv  Detail & Related papers  (2026-06-19T12:47:07Z)
• Reconstruction of finite Quasi-Probability and Probability from Principles: The Role of Syntactic Locality [0.0]
  Quasi-probabilities appear across diverse areas of physics, but their conceptual foundations remain unclear.<n>We develop a principled framework that derives quasi-probabilities and their conditional calculus from structural consistency requirements.
  arXiv  Detail & Related papers  (2026-02-12T19:00:08Z)
• BEDA: Belief Estimation as Probabilistic Constraints for Performing Strategic Dialogue Acts [69.7477004390211]
  We formalize two core acts Adversarial and Alignment, and operationalize them via probabilistic constraints on what an agent may generate.<n>We instantiate this idea in BEDA, a framework that consists of the world set, the belief estimator for belief estimation, and the conditional generator that selects acts and realizes utterances consistent with the inferred beliefs.
  arXiv  Detail & Related papers  (2025-12-31T14:26:55Z)
• Probabilistically stable revision and comparative probability: a representation theorem and applications [0.0]
  We show that a selection function can be representable as a strong-stable-set operator on a finite probability space.<n>The resulting logic of probabilistically stable belief revision exhibits strong monotonicity properties.<n>We point out two applications of our main result to the theory of simple voting games and to revealed preference theory.
  arXiv  Detail & Related papers  (2025-09-02T16:42:47Z)
• Toward a Graph-Theoretic Model of Belief: Confidence, Credibility, and Structural Coherence [0.0]
  This paper introduces a minimal formalism for belief systems as directed, weighted graphs.<n>Unlike logical and argumentation-based frameworks, it supports fine-grained structural representation without committing to binary justification status or deductive closure.<n>Its aim is to provide a foundational substrate for analyzing the internal organization of belief systems.
  arXiv  Detail & Related papers  (2025-08-05T14:03:23Z)
• Counterfactual Realizability [52.85109506684737]
  We introduce a formal definition of realizability, the ability to draw samples from a distribution, and then develop a complete algorithm to determine whether an arbitrary counterfactual distribution is realizable. We illustrate the implications of this new framework for counterfactual data collection using motivating examples from causal fairness and causal reinforcement learning.
  arXiv  Detail & Related papers  (2025-03-14T20:54:27Z)
• An Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation (full version) [6.983702226751596]
  The notion of conditional independence is studied in the framework of approximation fixpoint theory. This gives a language-independent account of conditional independence that can be straightforwardly applied to any logic with fixpoint semantics.
  arXiv  Detail & Related papers  (2024-12-18T10:52:57Z)
• Answering Causal Queries at Layer 3 with DiscoSCMs-Embracing Heterogeneity [0.0]
  This paper advocates for the Distribution-consistency Structural Causal Models (DiscoSCM) framework as a pioneering approach to counterfactual inference.
  arXiv  Detail & Related papers  (2023-09-17T17:01:05Z)
• Advancing Counterfactual Inference through Nonlinear Quantile Regression [77.28323341329461]
  We propose a framework for efficient and effective counterfactual inference implemented with neural networks. The proposed approach enhances the capacity to generalize estimated counterfactual outcomes to unseen data. Empirical results conducted on multiple datasets offer compelling support for our theoretical assertions.
  arXiv  Detail & Related papers  (2023-06-09T08:30:51Z)
• A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
  We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality. Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
  arXiv  Detail & Related papers  (2023-05-19T13:15:48Z)
• The Possibility of Fairness: Revisiting the Impossibility Theorem in Practice [5.175941513195566]
  We show that it is possible to identify a large set of models that satisfy seemingly incompatible fairness constraints. We offer tools and guidance for practitioners to understand when -- and to what degree -- fairness along multiple criteria can be achieved.
  arXiv  Detail & Related papers  (2023-02-13T13:29:24Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• Beyond Impossibility: Balancing Sufficiency, Separation and Accuracy [27.744055920557024]
  Tension between satisfying textitsufficiency and textitseparation We propose an objective that aims to balance textitsufficiency and textitseparation measures. We show promising results, where better trade-offs are achieved compared to existing alternatives.
  arXiv  Detail & Related papers  (2022-05-24T19:14:21Z)
• Incompatibility of observables, channels and instruments in information theories [68.8204255655161]
  We study the notion of compatibility for tests of an operational probabilistic theory. We show that a theory admits of incompatible tests if and only if some information cannot be extracted without disturbance.
  arXiv  Detail & Related papers  (2022-04-17T08:44:29Z)
• No-go theorems for deterministic purification and probabilistic enhancement of coherence [0.0]
  We prove that a quantum state cannot be deterministically purified if it can be expressed as a convex combination of an incoherent state and a coherent state. Our findings have repercussions on the understanding of quantum coherence in real quantum systems.
  arXiv  Detail & Related papers  (2022-03-29T05:02:31Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)
• Geometry of faithful entanglement [2.9475513512647455]
  A typical concept in quantum state analysis is based on the idea that states in the vicinity of some pure entangled state share the same properties. We prove a structural result on the corresponding fidelity-based entanglement witnesses, resulting in a simple condition for faithfulness of a two-party state.
  arXiv  Detail & Related papers  (2020-08-13T15:11:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.