Searcharxiv⌕ Search

arXiv subjects

Michel Grabisch

Publications and source records attributed to Michel Grabisch.

45 records · Page 3Linked to original sources
arXiv2008

The Symmetric Sugeno Integral

We propose an extension of the Sugeno integral for negative numbers, in the spirit of the symmetric extension of Choquet integral, also called \Sipos\ integral. Our framework is purely ordinal, since the Sugeno integral has its interest when the underlying structure is ordinal. We begin by defining negative numbers on a linearly ordered set, and we endow this new structure with a suitable algebra, very close to the ring of real numbers. In a second step, we introduce the Möbius transform on this new structure. Lastly, we define the symmetric Sugeno integral, and show its similarity with the symmetric Choquet integral.

cs.DM↗
arXiv2008

The Choquet integral for the aggregation of interval scales in multicriteria decision making

This paper addresses the question of which models fit with information concerning the preferences of the decision maker over each attribute, and his preferences about aggregation of criteria (interacting criteria). We show that the conditions induced by these information plus some intuitive conditions lead to a unique possible aggregation operator: the Choquet integral.

cs.DM↗
arXiv2008

The quest for rings on bipolar scales

We consider the interval $]{-1},1[$ and intend to endow it with an algebraic structure like a ring. The motivation lies in decision making, where scales that are symmetric w.r.t. 0 are needed in order to represent a kind of symmetry in the behaviour of the decision maker. A former proposal due to Grabisch was based on maximum and minimum. In this paper, we propose to build our structure on t-conorms and t-norms, and we relate this construction to uninorms. We show that the only way to build a group is to use strict t-norms, and that there is no way to build a ring. Lastly, we show that the main result of this paper is connected to the theory of ordered Abelian groups.

cs.DM↗
arXiv2007

Axiomatic structure of k-additive capacities

In this paper we deal with the problem of axiomatizing the preference relations modelled through Choquet integral with respect to a $k$-additive capacity, i.e. whose Möbius transform vanishes for subsets of more than $k$ elements. Thus, $k$-additive capacities range from probability measures ($k=1$) to general capacities ($k=n$). The axiomatization is done in several steps, starting from symmetric 2-additive capacities, a case related to the Gini index, and finishing with general $k$-additive capacities. We put an emphasis on 2-additive capacities. Our axiomatization is done in the framework of social welfare, and complete previous results of Weymark, Gilboa and Ben Porath, and Gajdos.

cs.DM↗
arXiv2007

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

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.

cs.DM↗
arXiv2007

Bi-capacities -- Part II: the Choquet integral

Bi-capacities arise as a natural generalization of capacities (or fuzzy measures) in a context of decision making where underlying scales are bipolar. They are able to capture a wide variety of decision behaviours, encompassing models such as Cumulative Prospect Theory (CPT). The aim of this paper in two parts is to present the machinery behind bi-capacities, and thus remains on a rather theoretical level, although some parts are firmly rooted in decision theory, notably cooperative game theory. The present second part focuses on the definition of Choquet integral. We give several expressions of it, including an expression w.r.t. the Möbius transform. This permits to express the Choquet integral for 2-additive bi-capacities w.r.t. the interaction index.

cs.DM↗
arXiv2007

Bi-capacities -- Part I: definition, Möbius transform and interaction

Bi-capacities arise as a natural generalization of capacities (or fuzzy measures) in a context of decision making where underlying scales are bipolar. They are able to capture a wide variety of decision behaviours, encompassing models such as Cumulative Prospect Theory (CPT). The aim of this paper in two parts is to present the machinery behind bi-capacities, and thus remains on a rather theoretical level, although some parts are firmly rooted in decision theory, notably cooperative game theory. The present first part is devoted to the introduction of bi-capacities and the structure on which they are defined. We define the Möbius transform of bi-capacities, by just applying the well known theory of M\" obius functions as established by Rota to the particular case of bi-capacities. Then, we introduce derivatives of bi-capacities, by analogy with what was done for pseudo-Boolean functions (another view of capacities and set functions), and this is the key point to introduce the Shapley value and the interaction index for bi-capacities. This is done in a cooperative game theoretic perspective. In summary, all familiar notions used for fuzzy measures are available in this more general framework.

cs.DM↗
arXiv2007

Derivative of functions over lattices as a basis for the notion of interaction between attributes

The paper proposes a general notion of interaction between attributes, which can be applied to many fields in decision making and data analysis. It generalizes the notion of interaction defined for criteria modelled by capacities, by considering functions defined on lattices. For a given problem, the lattice contains for each attribute the partially ordered set of remarkable points or levels. The interaction is based on the notion of derivative of a function defined on a lattice, and appears as a generalization of the Shapley value or other probabilistic values.

cs.DM↗
arXiv2007

Entropy of capacities on lattices and set systems

We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability measures. Capacities on lattices address the general case where the family of subsets is not necessarily the Boolean lattice of all subsets. Our definition encompasses the classical definition of Shannon for probability measures, as well as the entropy of Marichal defined for classical capacities. Some properties and examples are given.

cs.DM↗