### Abstract

Kuznetsov independence of variables X and Y means that, for any pair of bounded functions f(X) and g(Y), E[f(X)g(Y)]=E[f(X)] *times* E[g(Y)], where E[.] denotes interval-valued expectation and *times* denotes interval multiplication. We present properties of Kuznetsov independence for several variables, and connect it with other concepts of independence in the literature; in particular we show that strong extensions are always included in sets of probability distributions whose lower and upper expectations satisfy Kuznetsov independence. We introduce an algorithm that computes lower expectations subject to judgments of Kuznetsov independence by mixing column generation techniques with nonlinear programming. Finally, we define a concept of conditional Kuznetsov independence, and study its graphoid properties.

Original language | English |
---|---|

Pages (from-to) | 666-682 |

Number of pages | 17 |

Journal | International Journal of Approximate Reasoning |

Volume | 55 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2014 |

## Fingerprint Dive into the research topics of 'Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms'. Together they form a unique fingerprint.

## Cite this

Cozman, F. G., & de Campos, C. P. (2014). Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms.

*International Journal of Approximate Reasoning*,*55*(2), 666-682. https://doi.org/10.1016/j.ijar.2013.09.013