1,721,012 research outputs found
Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem
Pairwise comparison matrices (PCMs) have been a long standing technique for comparing alternatives/criteria and their role has been pivotal in the development of modern decision making methods. In order to obtain general results, suitable for several kinds of PCMs proposed in the literature, we focus on PCMs defined over a general unifying framework, that is an Abelian linearly ordered group. The paper deals with a crucial step in multi-criteria decision analysis, that is to obtain coherent weights for alternatives/criteria that are compared by means of a PCM. Firstly, we provide a condition ensuring coherent weights. Then, we provide and solve a mixed-integer linear programming problem in order to obtain the closest PCM, to a given PCM, having coherent weights. Isomorphisms and the mixed-integer linear programming problem allow us to solve an infinity of optimization problems, among them optimization problems concerning additive, multiplicative and fuzzy PCMs
Metodi, modelli e tecnologie per la Data Privacy
In un mondo sempre più digitale, dove i nostri dati risiedono in centinaia di database, come proteggere la privacy? Dalla ricerca scientifica, un progetto basato su reti bayesiane ed analytic hierarchy process, per sviluppare un modello atto a garantire la data privacy, è il vincitore del premio TR35 - giovani innovatori organizzato dal Forum Ricerca Innovazione Imprenditorialità e da Technology Review del MIT
Safeguarding the fundamental right of privacy
Technological progress and globalisation have profoundly changed the way our data is collected, accessed and used. We are in an era in which a huge rate of information of physical, biological, environmental, social and economic systems is produced. Recording, accessing and disseminating this information affect in a crucial way the progress of knowledge and the productivity of economy.
Public opinion has shown a growing awareness of privacy issues over the last few years. High-profile losses of personal information and growing concerns about the nature and extent of personal information collected by organizations has led to a growing debate about the impact of ICT pervasiveness on privacy.
The paper provides a brief overview of methods, tools and technologies for protecting the privacy, it encompasses disclosure control tools in statistical databases and privacy
requirements prioritization, and encourages further research in this research field
A further discussion of "A Semiring-based study of judgment matrices: properties and models" [Information Sciences 181 (2011) 2166-2176]
In the paper “A Semiring-based study of judgment matrices: properties and models” [Information Sciences 181 (2011) 2166–2176], the semiring is applied to the discussion of judgment matrix properties.
This paper shows that the suggested semirings could be replaced by a more convenient algebraic structure
Data Privacy in Statistical Databases. A Bayesian approach to deal with user uncertain knowledge in on-line auditing.
G-distance and G-decomposition for improving G-consistency of a Pairwise Comparison Matrix
Pairwise comparisons have been a long standing technique for comparing alternatives/criteria and their role has been pivotal in the development of modern decision making methods. Since consistency ensures rational decisions, in literature several approaches are proposed for the revision of the Pairwise Comparison Matrix in order to improve its consistency. In order to obtain general results, suitable for several kinds of Pairwise Comparison Matrices proposed in literature, we focus on matrices defined over a general unifying framework, that is an Abelian linearly ordered group. In this context, firstly, we provide G -distance between Pairwise Comparison Matrices and G -decomposition of a Pairwise Comparison Matrix in its G -consistent and totally G -inconsistent components. Then, we show how a G -inconsistent Pairwise Comparison Matrix can be revised according to the associated G -consistent component; the revision process takes into account G -distance from the former in order to better represent decision maker’s preferences
Computing random consistency indices and assessing priority vectors reliability
The paper deals with two crucial steps in multi-criteria decision analysis, that are consistency of the judgments and priority vectors for alternatives/criteria.
From a side, several consistency indices are proposed for measuring the consistency of a Pairwise Comparison Matrix. From another one, conditions weaker than consistency, such as transitivity and weak consistency, are proposed for representing further levels of coherence of a Decision Maker when he/she expresses his/her preferences by means of reciprocal Pairwise Comparison Matrix. Firstly, in this paper, a simulation is performed in order to establish a relation between random consistency index and coherence level.
Then, since weak consistency ensures reliability to priority vectors proposed in literature, a second simulation is performed in order to measure, in case of no weak consistency, the reliability of these priority vectors
Corrigendum to “Computing random consistency indices and assessing priority vectors reliability” [Information Sciences 420 (2017) 532-542]
Algorithm 2 given in Information Sciences 420 (2017) 532-542 is revised. Corrected algorithm does not affect abstract, main findings and conclusions of the original paper
- …
