Idempotent version of the Fréchet contingency array problem

From MaRDI portal





The author considers an extension of the Hoeffding--Fréchet problem to generalized measures with values in an idempotent, ordered semiring. As in the classical case there exists a unique upper bound and several minimal elements. The upper bound is given in explicit form. Some algorithm's are given (in the finite discrete case) to determine lower bounds. The authors give several motivations for the extension of the Hoeffding--Fréchet problem to idempotent algebraic structures.



Cites work









This page was built for publication: Idempotent version of the Fréchet contingency array problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040914)