Generalizing Jeffrey Conditionalization

03/13/2013
by   Carl G. Wagner, et al.
0

Jeffrey's rule has been generalized by Wagner to the case in which new evidence bounds the possible revisions of a prior probability below by a Dempsterian lower probability. Classical probability kinematics arises within this generalization as the special case in which the evidentiary focal elements of the bounding lower probability are pairwise disjoint. We discuss a twofold extension of this generalization, first allowing the lower bound to be any two-monotone capacity and then allowing the prior to be a lower envelope.

READ FULL TEXT

page 1

page 3

page 4

research
05/24/2021

A Simple Proof of a New Set Disjointness with Applications to Data Streams

The multiplayer promise set disjointness is one of the most widely used ...
research
06/06/2013

Tight Lower Bound on the Probability of a Binomial Exceeding its Expectation

We give the proof of a tight lower bound on the probability that a binom...
research
05/23/2020

MaxSAT Resolution and Subcube Sums

We study the MaxRes rule in the context of certifying unsatisfiability. ...
research
12/07/2020

Monotone Circuit Lower Bounds from Robust Sunflowers

Robust sunflowers are a generalization of combinatorial sunflowers that ...
research
01/09/2019

Generalized Deduplication: Bounds, Convergence, and Asymptotic Properties

We study a generalization of deduplication, which enables lossless dedup...
research
04/26/2023

Fundamental Tradeoffs in Learning with Prior Information

We seek to understand fundamental tradeoffs between the accuracy of prio...
research
01/16/2014

Active Tuples-based Scheme for Bounding Posterior Beliefs

The paper presents a scheme for computing lower and upper bounds on the ...

Please sign up or login with your details

Forgot password? Click here to reset