Idempotent version of the Fréchet contingency array problem

Chams Lahlou (1, 2) , Laurent Truffet (2)

1 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
2 Mines Nantes - Mines Nantes

In this paper we study the idempotent version of the so-called Fréchet correlation array problem. The problem is studied using an algebraic approach. The major result is that there exists a unique upper bound and several lower bounds. The formula for the upper bound is given. An algorithm is proposed to compute one lower bound. Another algorithm is provided to compute all lower bounds, but the number of lower bounds may be a very large number. Note that all these results are only based on the distributive lattice property of the idempotent algebraic structure.

Mots clés: Algebra; Non-additive measures; Ordered structure

Domaines: Probabilités [math.PR]; Statistiques [math.ST]; Théorie [stat.TH]

Chams Lahlou, Laurent Truffet. Idempotent version of the Fréchet contingency array problem. Fuzzy Sets and Systems, 2009, 160 (16), pp.2317-2327. ⟨10.1016/j.fss.2009.03.003⟩. ⟨hal-00862811⟩