The Möbius transform on symmetric ordered structures and its application to capacities on finite sets

Michel Grabisch 1
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry necessarily entails non associativity, hence computing rules are defined in order to deal with non associativity. We study in details computing rules, which we endow with a partial order. This permits to find solutions to the inversion formula underlying the Möbius transform. Then we apply these results to the case of capacities, a notion from decision theory which corresponds, in the language of ordered sets, to order preserving mappings, preserving also top and bottom. In this case, the solution of the inversion formula is called the Möbius transform of the capacity. Properties and examples of Möbius transform of sup-preserving and inf-preserving capacities are given.
Keywords : ?
Liste complète des métadonnées

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00188158
Contributor : Michel Grabisch <>
Submitted on : Thursday, November 15, 2007 - 5:34:15 PM
Last modification on : Wednesday, December 12, 2018 - 1:25:58 AM
Document(s) archivé(s) le : Monday, April 12, 2010 - 2:21:58 AM

Files

discrete_maths01.pdf
Files produced by the author(s)

Identifiers

Citation

Michel Grabisch. The Möbius transform on symmetric ordered structures and its application to capacities on finite sets. Discrete Mathematics, Elsevier, 2004, 287 (1-3), pp.17-34. ⟨10.1016/j.disc.2004.05.013⟩. ⟨hal-00188158⟩

Share

Metrics

Record views

337

Files downloads

172