
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 ...
read it

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...
read it

Monotone Circuit Lower Bounds from Robust Sunflowers
Robust sunflowers are a generalization of combinatorial sunflowers that ...
read it

Generalized Deduplication: Bounds, Convergence, and Asymptotic Properties
We study a generalization of deduplication, which enables lossless dedup...
read it

Limitations of the Hyperplane Separation Technique for Bounding the Extension Complexity of Polytopes
This note illustrates the limitations of the hyperplane separation bound...
read it

Independence with Lower and Upper Probabilities
It is shown that the ability of the interval probability representation ...
read it

Active Tuplesbased Scheme for Bounding Posterior Beliefs
The paper presents a scheme for computing lower and upper bounds on the ...
read it
Generalizing Jeffrey Conditionalization
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 twomonotone capacity and then allowing the prior to be a lower envelope.
READ FULL TEXT
Comments
There are no comments yet.