Exact bounds of the M{\"o}bius inverse of monotone set functions
Michel Grabisch (EEP-PSE, CES), Pedro Miranda

TL;DR
This paper precisely determines the maximum and minimum values of the M{"o}bius inverse for monotone normalized set functions, revealing their asymptotic behavior and providing bounds for related transforms and specific subclasses.
Contribution
It introduces exact bounds for the M{"o}bius inverse of monotone normalized set functions and related transforms, including for specific subclasses like k-additive and p-symmetric capacities.
Findings
Bounds tend to 4^{n/2} * sqrt(pi*n/2) as n grows large
Exact bounds established for the interaction and Banzhaf interaction transforms
Bounds derived for k-additive and p-symmetric normalized capacities
Abstract
We give the exact upper and lower bounds of the M{\"o}bius inverse of monotone and normalized set functions (a.k.a. normalized capacities) on a finite set of n elements. We find that the absolute value of the bounds tend to 4 n/2 \sqrt n/2 when n is large. We establish also the exact bounds of the interaction transform and Banzhaf interaction transform, as well as the exact bounds of the M{\"o}bius inverse for the subfamilies of k-additive normalized capacities and p-symmetric normalized capacities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Advanced Optimization Algorithms Research · Limits and Structures in Graph Theory
