Michel Grabisch

Prof. Michel Grabisch


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 October 2009 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
MGMichel Grabisch
Michel Grabisch
CLChristophe Labreuche
Christophe Labreuche


17 December 2020 in Games
Verified
Journal Article
Open access
PDF file
MGMichel Grabisch
Michel Grabisch
ARAgnieszka Rusinowska
Agnieszka Rusinowska
The paper presents a survey on selected models of opinion dynamics. Both discrete (more precisely, binary) opinion models as well as continuous opinion models are discussed. We focus on frameworks that assume non-Bayesian updating of opinions. In the survey, a special attention is paid to modeling nonconformity (in particular, anticonformity) behavior. For the case of opinions represented by a binary variable, we recall the threshold model, the voter and q-voter models, the majority rule model, and the aggregation framework. For the case of continuous opinions, we present the DeGroot model and some of its variations, time-varying models, and bounded confidence models.

4 April 2010 in Theory and Decision
Verified
Journal Article
Open access
PDF file
BMBrice Mayag
Brice Mayag
MGMichel Grabisch
Michel Grabisch
CLChristophe Labreuche
Christophe Labreuche
In the context of Multiple criteria decision analysis, we present the necessary and sufficient conditions allowing to represent an ordinal preferential information provided by the decision maker by a Choquet integral w.r.t a 2-additive capacity. We provide also a characterization of this type of preferential information by a belief function which can be viewed as a capacity. These characterizations are based on three axioms, namely strict cycle-free preferences and some monotonicity conditions called MOPI and 2-MOPI.

23 April 2008 in Theory and Decision
Verified
Journal Article
Closed access
PDF file
MGMichel Grabisch
Michel Grabisch
ARAgnieszka Rusinowska
Agnieszka Rusinowska

18 November 2008 in International Journal of Intelligent Systems
Verified
Journal Article
Closed access
PDF file
MGMichel Grabisch
Michel Grabisch
We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our needs. We show that all classical constructions and definitions (e.g., mass allocation, commonality function, plausibility functions, necessity measures with nested focal elements, possibility distributions, Dempster rule of combination, decomposition with regard to simple support functions, etc.) remain valid in this general setting. Moreover, our proof of decomposition of belief functions into simple support functions is much simpler and general than the original one by Shafer.