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

Michel Grabisch

Post-Print from HAL

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: ? (search for similar items in EconPapers)
Date: 2004-10
Note: View the original document on HAL open archive server: https://hal.science/hal-00188158
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Published in Discrete Mathematics, 2004, 287 (1-3), pp.17-34. ⟨10.1016/j.disc.2004.05.013⟩

Downloads: (external link)
https://hal.science/hal-00188158/document (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00188158

DOI: 10.1016/j.disc.2004.05.013

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().