pdf
... connection between the probability of disjoint events and the probability of their union. Such an assumption can be viewed as providing a systematic basis for dealing with the combination of evidence, as well as providing a certain modularity in the description of probabilities. For example, if is ...
... connection between the probability of disjoint events and the probability of their union. Such an assumption can be viewed as providing a systematic basis for dealing with the combination of evidence, as well as providing a certain modularity in the description of probabilities. For example, if is ...
A Quantitative Version of the Gibbard-Satterthwaite theorem for Three Alternatives
... Since the preliminary version of this paper [FKN08] appeared in FOCS’08, three follow-up works generalized its results to more than three alternatives, under various additional constraints. The first follow-up work is by Xia and Conitzer [XC08], who use similar techniques to show that a random manip ...
... Since the preliminary version of this paper [FKN08] appeared in FOCS’08, three follow-up works generalized its results to more than three alternatives, under various additional constraints. The first follow-up work is by Xia and Conitzer [XC08], who use similar techniques to show that a random manip ...
P - Computing Science
... 2. P(A) = P([A and B) (A and not B)]) = P(A and B) + P(A and not B) – P([A and B) (A and not B)]). Disjunction Rule. 3. [A and B) (A and not B)] is logically equivalent to false, so P([A and B) (A and not B)]) =0. 4. So 2. implies P(A) = P(A and B) + P(A and not B). ...
... 2. P(A) = P([A and B) (A and not B)]) = P(A and B) + P(A and not B) – P([A and B) (A and not B)]). Disjunction Rule. 3. [A and B) (A and not B)] is logically equivalent to false, so P([A and B) (A and not B)]) =0. 4. So 2. implies P(A) = P(A and B) + P(A and not B). ...