This paper studies the problem of marginalizing convex polytopes of probabilities represented by a set of constraints. This marginalization is obtained as a special case of projection on a specific subspace. An algorithm that projects a convex polytope on any subspace has been built and the expression of the subspace, where the projection must be made for obtaining the marginalization, has been calculated.
@article{urn:eudml:doc:39215,
title = {Marginalization like a projection.},
journal = {Mathware and Soft Computing},
volume = {8},
year = {2001},
pages = {93-112},
zbl = {1014.68167},
mrnumber = {MR1873160},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39215}
}
Verdegay-López, Juan Francisco; Moral, Serafín. Marginalization like a projection.. Mathware and Soft Computing, Tome 8 (2001) pp. 93-112. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39215/