Search

AI regulations are expected to prohibit machine learning models from using sensitive attributes during training. However, the latest Natural Language Processing (NLP) classifiers, which rely on deep learning, operate as black-box systems, complicating the detection and remediation of such misuse. Traditional bias mitigation methods in NLP aim for comparable performance across different groups based on attributes like gender or race but fail to address the underlying issue of reliance on protected attributes. To partly fix that, we introduce NLPGuard, a framework for mitigating the reliance on protected attributes in NLP classifiers. NLPGuard takes an unlabeled dataset, an existing NLP classifier, and its training data as input, producing a modified training dataset that significantly reduces dependence on protected attributes without compromising accuracy. NLPGuard is applied to three classification tasks: identifying toxic language, sentiment analysis, and occupation classification. Our evaluation shows that current NLP classifiers heavily depend on protected attributes, with up to $23\%$ of the most predictive words associated with these attributes. However, NLPGuard effectively reduces this reliance by up to $79\%$, while slightly improving accuracy., Comment: Paper accepted at CSCW 2024

Concept Drift is a phenomenon in which the underlying data distribution and statistical properties of a target domain change over time, leading to a degradation of the model's performance. Consequently, models deployed in production require continuous monitoring through drift detection techniques. Most drift detection methods to date are supervised, i.e., based on ground-truth labels. However, true labels are usually not available in many real-world scenarios. Although recent efforts have been made to develop unsupervised methods, they often lack the required accuracy, have a complexity that makes real-time implementation in production environments difficult, or are unable to effectively characterize drift. To address these challenges, we propose DriftLens, an unsupervised real-time concept drift detection framework. It works on unstructured data by exploiting the distribution distances of deep learning representations. DriftLens can also provide drift characterization by analyzing each label separately. A comprehensive experimental evaluation is presented with multiple deep learning classifiers for text, image, and speech. Results show that (i) DriftLens performs better than previous methods in detecting drift in $11/13$ use cases; (ii) it runs at least 5 times faster; (iii) its detected drift value is very coherent with the amount of drift (correlation $\geq 0.85$); (iv) it is robust to parameter changes.

The seven-valued logic considered in this paper naturally arises within the rough set framework, allowing to distinguish vagueness due to imprecision from ambiguity due to coarseness. Recently, we discussed its utility for reasoning about data describing multi-attribute classification of objects. We also showed that this logic contains, as a particular case, the celebrated Belnap four-valued logic. Here, we present how the seven-valued logic, as well as the other logics that derive from it, can be used to represent preferences in the domain of Multiple Criteria Decision Aiding (MCDA). In particular, we propose new forms of outranking and value function preference models that aggregate multiple criteria taking into account imperfect preference information. We demonstrate that our approach effectively addresses common challenges in preference modeling for MCDA, such as uncertainty, imprecision, and ill-determination of performances and preferences. To this end, we present a specific procedure to construct a seven-valued preference relation and use it to define recommendations that consider robustness concerns by utilizing multiple outranking or value functions representing the decision maker s preferences. Moreover, we discuss the main properties of the proposed seven-valued preference structure and compare it with current approaches in MCDA, such as ordinal regression, robust ordinal regression, stochastic multiattribute acceptability analysis, stochastic ordinal regression, and so on. We illustrate and discuss the application of our approach using a didactic example. Finally, we propose directions for future research and potential applications of the proposed methodology.

In this paper, we consider the recently introduced application of the Deck of Cards Method (DCM) to ordinal regression proposing an extension to Robust Ordinal Regression and Stochastic Multiattribute Acceptability Analysis. In Multiple Criteria Decision Aiding context, the proposed methodology permits to assign a value to each alternative evaluated on a set of criteria hierarchically structured. The Decision Maker can provide precise or imprecise information at different levels of the hierarchy of criteria using the classical DCM framework. This information is therefore used to infer a value function compatible with it. The compatible value function can be a simple weighted sum, a piecewise linear value function, a general monotonic value function, or a Choquet integral. To provide robust recommendations to the Decision Maker, we consider the Robust Ordinal Regression and the Stochastic Multicriteria Acceptability Analysis because, even if in different ways, both of them take into account the whole set of models compatible with the preference information provided by the Decision Maker. The applicability of the proposed methodology is shown by a didactic example in which Italian regions are evaluated on criteria representing Circular Economy, Innovation Driven Development and Smart Specialization Strategies.

Interpretability is the next frontier in machine learning research. In the search for white box models - as opposed to black box models, like random forests or neural networks - rule induction algorithms are a logical and promising option, since the rules can easily be understood by humans. Fuzzy and rough set theory have been successfully applied to this archetype, almost always separately. As both approaches to rule induction involve granular computing based on the concept of equivalence classes, it is natural to combine them. The QuickRules\cite{JensenCornelis2009} algorithm was a first attempt at using fuzzy rough set theory for rule induction. It is based on QuickReduct, a greedy algorithm for building decision reducts. QuickRules already showed an improvement over other rule induction methods. However, to evaluate the full potential of a fuzzy rough rule induction algorithm, one needs to start from the foundations. In this paper, we introduce a novel rule induction algorithm called Fuzzy Rough Rule Induction (FRRI). We provide background and explain the workings of our algorithm. Furthermore, we perform a computational experiment to evaluate the performance of our algorithm and compare it to other state-of-the-art rule induction approaches. We find that our algorithm is more accurate while creating small rulesets consisting of relatively short rules. We end the paper by outlining some directions for future work.

We are considering the algebraic structure of the Pawlak-Brouwer-Zadeh lattice to distinguish vagueness due to imprecision from ambiguity due to coarseness. We show that a general class of many-valued logics useful for reasoning about data emerges from this context. All these logics can be obtained from a very general seven-valued logic which, interestingly enough, corresponds to a reasoning system developed by Jaina philosophers four centuries BC. In particular, we show how the celebrated Belnap four-valued logic can be obtained from the very general seven-valued logic based on the Pawlak-Brouwer-Zadeh lattice.

Understanding how people actually trade off time for money is perhaps the major question in the field of time discounting. There is indeed a vast body of work devoted to explore the underlying mechanisms of the individual decision making process in an intertemporal context. This paper presents a family of new discount functions whereof we derive a formal axiomatization. Applying the framework proposed by Bleichrodt, Rohde and Wakker, we further extend their formulation of CADI and CRDI functions, making discounting a function not only of time delay but, simultaneously, also of time distortion. Our main purpose is, in practice, to provide a tractable setting within which individual intertemporal preferences can be outlined. Furthermore, we apply our models to study the relation between individual time preferences and personality traits. For the CADI-CADI, results show that the habit of smoking is heavily related with both impatience and time perception. Within the Big-Five framework, conscientiousness, agreeableness and openness are positively related with patience (low r, initial discount rate).

In this paper, we present a methodology based on a multiobjective optimization suggesting which facility to implement, in which location, and at which time. In this context, we define a new elicitation procedure to handle Decision Makers (DMs) preferences with an intrinsic and more general interest that goes beyond the specific decision problem. In particular, the user's preferences are elicited by conjugating the deck of cards method with the ordinal regression approach allowing the DM to provide preference information in terms of ranking and pairwise comparing with regard to the intensity of preference of some solutions of the optimization problem. Then, the score of the reference solutions obtained through the deck of the cards method is used as a basis for an ordinal regression procedure that, to take into account interaction between criteria, represents DM's multicriteria preferences by means of a value function expressed in terms of a Choquet Integral. The obtained value function is then used to define a multiobjective optimization problem. The new feasible solutions obtained by the resolution of the optimization problem are proposed to the DM to verify his appreciation and collect further new preference information to iterate the interaction procedure ending when the DM is satisfied of the proposed solution. We apply our methodology to a real world problem to handle the planning procedure of a sustainable Ecovillage in the province of Turin (Italy). We consider a set of facilities to be distributed in a given space in a proper temporal sequence that we conveniently formulated in terms of the space time model introduced by Barbati et al. (2020). We interact with the President of the cooperative owning the Ecovillage to detail what facilities of the Ecovillage should be selected among the proposed ones, where they should be located, and when they should be planned.

In multiple criteria decision aiding, very often the alternatives are compared by means of a value function compatible with the preferences expressed by the Decision Maker. The problem is that, in general, there is a plurality of compatible value functions, and providing a final recommendation on the problem at hand considering only one of them could be considered arbitrary to some extent. For such a reason, Stochastic Multicriteria Acceptability Analysis gives information in statistical terms by taking into account a sample of models compatible with the provided preferences. These statistics are given assuming the existence of a probability distribution in the space of value functions being defined a priori. In this paper, we propose some methods aiming to build a probability distribution on the space of value functions considering the preference information given by the Decision Maker. To prove the goodness of our proposal we performed an extensive set of simulations. Moreover, a sensitivity analysis on the variables of our procedure has been done as well.

Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This encyclopedic article consists of two main sections: methods and applications. The first aims to summarise the up-to-date knowledge and provide an overview of the state-of-the-art methods and key developments in the various subdomains of the field. The second offers a wide-ranging list of areas where Operational Research has been applied. The article is meant to be read in a nonlinear fashion. It should be used as a point of reference or first-port-of-call for a diverse pool of readers: academics, researchers, students, and practitioners. The entries within the methods and applications sections are presented in alphabetical order. The authors dedicate this paper to the 2023 Turkey/Syria earthquake victims. We sincerely hope that advances in OR will play a role towards minimising the pain and suffering caused by this and future catastrophes.

Dominance-based Rough Approach (DRSA) has been proposed as a machine learning and knowledge discovery methodology to handle Multiple Criteria Decision Aiding (MCDA). Due to its capacity of asking the decision maker (DM) for simple preference information and supplying easily understandable and explainable recommendations, DRSA gained much interest during the years and it is now one of the most appreciated MCDA approaches. In fact, it has been applied also beyond MCDA domain, as a general knowledge discovery and data mining methodology for the analysis of monotonic (and also non-monotonic) data. In this contribution, we recall the basic principles and the main concepts of DRSA, with a general overview of its developments and software. We present also a historical reconstruction of the genesis of the methodology, with a specific focus on the contribution of Roman S{\l}owi\'nski., Comment: This research was partially supported by TAILOR, a project funded by European Union (EU) Horizon 2020 research and innovation programme under GA No 952215. This submission is a preprint of a book chapter accepted by Springer, with very few minor differences of just technical nature

In this article, a new Fuzzy Granular Approximation Classifier (FGAC) is introduced. The classifier is based on the previously introduced concept of the granular approximation and its multi-class classification case. The classifier is instance-based and its biggest advantage is its local transparency i.e., the ability to explain every individual prediction it makes. We first develop the FGAC for the binary classification case and the multi-class classification case and we discuss its variation that includes the Ordered Weighted Average (OWA) operators. Those variations of the FGAC are then empirically compared with other locally transparent ML methods. At the end, we discuss the transparency of the FGAC and its advantage over other locally transparent methods. We conclude that while the FGAC has similar predictive performance to other locally transparent ML models, its transparency can be superior in certain cases.

We consider multiobjective combinatorial optimization problems handled by means of preference driven efficient heuristics. They look for the most preferred part of the Pareto front on the basis of some preferences expressed by the Decision Maker during the process. In general, what is searched for in this case is the Pareto set of efficient solutions. This is a problem much more difficult than optimizing a single objective function. Moreover, obtaining the Pareto set does not mean that the decision problem is solved since one or some of the solutions have to be chosen. Indeed, to make a decision, it is necessary to determine the most preferred solution in the Pareto set, so that it is also necessary to elicit the preferences of the user. In this perspective, what we are proposing can be seen as the first structured methodology in facility location problems to search optimal solutions taking into account preferences of the user. With this aim, we approach facility location problems using a recently proposed interactive evolutionary multiobjective optimization procedure called NEMO-II-Ch. NEMO-II-Ch is applied to a real world multiobjective location problem with many users and many facilities to be located. Several simulations considering different fictitious users have been performed. The results obtained by NEMO-II-Ch are compared with those got by three algorithms which know the user's true value function that is, instead, unknown to NEMO-II-Ch. They show that in many cases NEMO-II-Ch finds the best subset of locations more quickly than the methods knowing, exactly, the whole user's true preferences.

In granular computing, fuzzy sets can be approximated by granularly representable sets that are as close as possible to the original fuzzy set w.r.t. a given closeness measure. Such sets are called granular approximations. In this article, we introduce the concepts of disjoint and adjacent granules and we examine how the new definitions affect the granular approximations. First, we show that the new concepts are important for binary classification problems since they help to keep decision regions separated (disjoint granules) and at the same time to cover as much as possible of the attribute space (adjacent granules). Later, we consider granular approximations for multi-class classification problems leading to the definition of a multi-class granular approximation. Finally, we show how to efficiently calculate multi-class granular approximations for {\L}ukasiewicz fuzzy connectives. We also provide graphical illustrations for a better understanding of the introduced concepts.

Inconsistency in prediction problems occurs when instances that relate in a certain way on condition attributes, do not follow the same relation on the decision attribute. For example, in ordinal classification with monotonicity constraints, it occurs when an instance dominating another instance on condition attributes has been assigned to a worse decision class. It typically appears as a result of perturbation in data caused by incomplete knowledge (missing attributes) or by random effects that occur during data generation (instability in the assessment of decision attribute values). Inconsistencies with respect to a crisp preorder relation (expressing either dominance or indiscernibility between instances) can be handled using symbolic approaches like rough set theory and by using statistical/machine learning approaches that involve optimization methods. Fuzzy rough sets can also be seen as a symbolic approach to inconsistency handling with respect to a fuzzy relation. In this article, we introduce a new machine learning method for inconsistency handling with respect to a fuzzy preorder relation. The novel approach is motivated by the existing machine learning approach used for crisp relations. We provide statistical foundations for it and develop optimization procedures that can be used to eliminate inconsistencies. The article also proves important properties and contains didactic examples of those procedures.

In this paper we propose a new methodology to represent the results of the robust ordinal regression approach by means of a family of representative value functions for which, taken two alternatives $a$ and $b$, the following two conditions are satisfied: 1) if for all compatible value functions $a$ is evaluated not worse than $b$ and for at least one value function $a$ has a better evaluation, then the evaluation of $a$ is greater than the evaluation of $b$ for all representative value functions; 2) if there exists one compatible value function giving $a$ an evaluation greater than $b$ and another compatible value function giving $a$ an evaluation smaller than $b$, then there are also at least one representative function giving a better evaluation to $a$ and another representative value function giving $a$ an evaluation smaller than $b$. This family of representative value functions intends to provide the Decision Maker (DM) a more clear idea of the preferences obtained by the compatible value functions, with the aim to support the discussion in constructive approach of Multiple Criteria Decision Aiding.

The pairwise winning indices, computed in the Stochastic Multicriteria Acceptability Analysis, give the probability with which an alternative is preferred to another taking into account all the instances of the assumed preference model compatible with the information provided by the Decision Maker in terms of pairwise preference comparisons of reference alternatives. In this paper we present a new scoring method assigning a value to each alternative summarizing the results of the pairwise winning indices. Several procedures assigning a score to each alternative on the basis of the pairwise winning indices have been provided in literature. However, while all of them compute this score just to rank the alternatives under consideration, our method, expressing the score in terms of an additive value function, permits to disaggregate the overall evaluation of each alternative in the sum of contributions of considered criteria. This will permit not only to rank the alternatives but also to explain the reasons for which an alternative obtains its evaluation and, consequently, fills a certain ranking position. To prove the efficiency of the method in representing the preferences of the Decision Maker, we performed an extensive set of simulations varying the number of alternatives and criteria. The results of the simulations, analyzed from a statistical point of view, show the goodness of our procedure. The applicability of the method to decision making problems is explained by means of a case study related to the evaluation of financial funds.

Inconsistency in pairwise comparison judgements is often perceived as an unwanted phenomenon and researchers have proposed a number of techniques to either reduce it or to correct it. We take a viewpoint that this inconsistency unleashes different mindsets of the decision maker(s) that should be taken into account when generating recommendations as decision support. With this aim we consider the spanning trees analysis which is a recently emerging idea for use with the pairwise comparison approach that represents the plurality of mindsets (in terms of a plurality of vectors corresponding to different spanning trees). Until now, the multiplicity of the vectors supplied by the spanning trees approach have been amalgamated into a single preference vector, losing the information about the plurality of mindsets. To preserve this information, we propose a novel methodology taking an approach similar to Stochastic Multi-criteria Acceptability Analysis. Considering all the rankings of alternatives corresponding to the different mindsets, our methodology gives the probability that an alternative attains a given ranking position as well as the probability that an alternative is preferred to another one. Since the exponential number of spanning trees makes their enumeration prohibitive, we propose computing approximate probabilities using statistical sampling of the spanning trees. Our approach is also appealing because it can be applied also to incomplete sets of pairwise comparisons. We demonstrate its usefulness with a didactic example as well as with an application to a real-life case of selecting a Telecom backbone infrastructure for rural areas.

Despite the high accuracy offered by state-of-the-art deep natural-language models (e.g. LSTM, BERT), their application in real-life settings is still widely limited, as they behave like a black-box to the end-user. Hence, explainability is rapidly becoming a fundamental requirement of future-generation data-driven systems based on deep-learning approaches. Several attempts to fulfill the existing gap between accuracy and interpretability have been done. However, robust and specialized xAI (Explainable Artificial Intelligence) solutions tailored to deep natural-language models are still missing. We propose a new framework, named T-EBAnO, which provides innovative prediction-local and class-based model-global explanation strategies tailored to black-box deep natural-language models. Given a deep NLP model and the textual input data, T-EBAnO provides an objective, human-readable, domain-specific assessment of the reasons behind the automatic decision-making process. Specifically, the framework extracts sets of interpretable features mining the inner knowledge of the model. Then, it quantifies the influence of each feature during the prediction process by exploiting the novel normalized Perturbation Influence Relation index at the local level and the novel Global Absolute Influence and Global Relative Influence indexes at the global level. The effectiveness and the quality of the local and global explanations obtained with T-EBAnO are proved on (i) a sentiment analysis task performed by a fine-tuned BERT model, and (ii) a toxic comment classification task performed by an LSTM model.

Assessing the technical efficiency of a set of observations requires that the associated data composed of inputs and outputs are perfectly known. If this is not the case, then biased estimates will likely be obtained. Data Envelopment Analysis (DEA) is one of the most extensively used mathematical models to estimate efficiency. It constructs a piecewise linear frontier against which all observations are compared. Since the frontier is empirically defined, any deviation resulting from low data quality (imperfect knowledge of data or IKD) may lead to efficiency under/overestimation. In this study, we model IKD and, then, apply the so-called Hit \& Run procedure to randomly generate admissible observations, following some prespecified probability density functions. Sets used to model IKD limit the domain of data associated with each observation. Any point belonging to that domain is a candidate to figure out as the observation for efficiency assessment. Hence, this sampling procedure must run a sizable number of times (infinite, in theory) in such a way that it populates the whole sets. The DEA technique is used during the execution of each iteration to estimate bootstrapped efficiency scores for each observation. We use some scenarios to show that the proposed routine can outperform some of the available alternatives. We also explain how efficiency estimations can be used for statistical inference. An empirical case study based on the Portuguese public hospitals database (2013-2016) was addressed using the proposed method.

In this paper we propose a new multiple criteria decision aiding method to deal with sorting problems in which alternatives are evaluated on criteria structured in a hierarchical way and presenting interactions. The underlying preference model of the proposed method is the Choquet integral, while the hierarchical structure of the criteria is taken into account by applying the Multiple Criteria Hierarchy Process. Considering the Choquet integral based on a 2-additive capacity, the paper presents a procedure to find all the minimal sets of pairs of interacting criteria representing the preference information provided by the Decision Maker (DM). Robustness concerns are also taken into account by applying the Robust Ordinal Regression and the Stochastic Multicriteria Acceptability Analysis. Even if in different ways, both of them provide recommendations on the hierarchical sorting problem at hand by exploring the whole set of capacities compatible with the preferences provided by the DM avoiding to take into account only one of them. The applicability of the considered method to real world problems is demonstrated by means of an example regarding rating of European Countries by considering economic and financial data provided by Standard \& Poor's Global Inc.

A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the feasible subsets of the given item set and show that this relation defines a preorder. We propose a dynamic programming algorithm to compute the entire set of non-dominated rank cardinality vectors and we state two greedy algorithms, which efficiently compute a single efficient solution.

The paper shows how Multiple Criteria Decision Aiding (MCDA) tools can support the analyses of six hypotheses of adaptive reuse of an iconic historical building in Turin, Italy (called Stock Exchange) to identify the preferred alternative. In the last two years, the debate around the requalification of the building has been huge for several reasons: it is perceived as a "monument" by citizens; it shows architectural and typological values nationally recognized; it involves public and private interests. In this context, interacting with experts involved in the ongoing discussion, we consider a recently proposed conjunction of four MCDA methods, namely: Multiple Criteria Hierarchy Process (MCHP), permitting to consider structural relationships between criteria; ELECTRE III, considering three types of interaction effects between criteria (strengthening, weakening and antagonistic effects); the imprecise SRF method, supplying an easily understandable approach to collect information from the DM; and Stochastic Multicriteria Acceptability Analysis (SMAA), providing robust recommendation, in terms of rankings and relations of preference, indifference and incomparability between project alternatives, at each level of the hierarchy. We propose a modification of the SRF methodology, called SFR-II, to increase the reliability of the decision aid procedure, which could constitute a significant advance for the same SRF method.

The level dependent Choquet integral has been proposed to handle decision making problems in which the importance and the interaction of criteria may depend on the level of the alternatives' evaluations. This integral is based on a level dependent capacity, which is a family of single capacities associated to each level of evaluation for the considered criteria. We present two possible formulations of the level dependent capacity where importance and interaction of criteria are constant inside each one of the subintervals in which the interval of evaluations for considered criteria is split or vary with continuity inside the whole interval of evaluations. Since, in general, there is not only one but many level dependent capacities compatible with the preference information provided by the Decision Maker, we propose to take into account all of them by using the Robust Ordinal Regression (ROR) and the Stochastic Multicriteria Acceptability Analysis (SMAA). On one hand, ROR defines a necessary preference relation (if an alternative a is at least as good as an alternative b for all compatible level dependent capacities), and a possible preference relation (if a is at least as good as b for at least one compatible level dependent capacity). On the other hand, considering a random sampling of compatible level dependent capacities, SMAA gives the probability that each alternative reaches a certain ranking position as well as the probability that an alternative is preferred to another. A real-world decision problem on rankings of universities is provided to illustrate the proposed methodology.

For long time the measurement of innovation has been in the forefront of policy makers' and researchers' agenda worldwide. Therefore, there is an ongoing debate about which indicators should be used to measure innovation. Recent approaches have favoured the use of composite innovation indicators. However, there is no consensus about the appropriate methodology to aggregate the varying dimensions of innovation into a single summary indicator. One of the best known examples of composite innovation indicators is the European Innovation Scoreboard (EIS). It is a relevant tool for benchmarking innovation in Europe. Still, the EIS lacks a proper scheme for weighting the included indicators according to their relative importance. In this context, we propose an appraisal methodology permitting to take into consideration the interaction of criteria and robustness concerns related to the elicitation of the weights assigned to the elementary indicators. With this aim, we apply the hierarchical-SMAA-Choquet integral approach. This integrated multicriteria decision making (MCDM) method helps the users to rank and benchmark countries' innovation performance taking into account the importance and interaction of criteria assigned by themselves, rather than equal weights or weights exogenously fixed by external experts.

In this paper we present (to the best of our knowledge) the first outranking method to assign a score to each alternative. It is a method of the Electre family, and we will call it Electre-Score. Contrarily to the Multi-Attribute Value Theory methods, Electre-Score does not construct a value function for each criterion, and then proceeds to the aggregation into a single value. It rather, makes use of the outranking relations to make a comparison with reference sets of actions (to which a score is assigned) and proposes a score range to each alternative, instead of a single value. This is a more robust way of proceeding given the fragility of a single score. The sets of limiting profiles are defined with the help of Electre Tri-nB and the reference scores are assigned to them through the application of the deck of cards technique. The fact of being able to use outranking relations, makes it also possible to take into account the imperfect knowledge of data and avoids systematic compensatory effects. Some fundamental theoretical results guaranteeing the consistency of the method and an illustrative example are also provided in this paper.

This paper deals with an improved version of the deck of the cards method to render the construction of the ratio and interval scales more `accurate'. The improvement comes from the fact that we can account for a richer and finer preference information provided by the decision-makers, which permits a more accurate modelling of the strength of preference between two consecutive levels of a scale. Instead of considering only the number of blank cards between consecutive positions in the ranking of objects such as criteria and scale levels, we consider also the number of blank cards between non consecutive positions in the ranking. This information is collected in a pairwise comparison table that it is not necessarily built with precise values. We can consider also missing information and imprecise information provided in the form of ranges. Since the information provided by the decision-makers is not necessarily consistent, we propose also some procedures to help the decision-maker to make consistent his evaluations in a co-constructive way interacting with an analyst and reflecting and revising her/his judgments. The method is illustrated through and example in which, generalizing the SWING method, interacting criteria are aggregated through the Choquet integral.

This paper presents a new methodology that combines a multiple criteria sorting or ranking method with a project portfolio selection procedure. The multicriteria method permits to compare projects in terms of their priority assessed on the basis of a set of both qualitative and quantitative criteria. Then, a feasible set of projects, i.e. a portfolio, is selected according to the priority defined by the multiple criteria method. In addition, the portfolio must satisfy a set of resources constraints, e.g. budget available, as well as some logical constraints, e.g. related to projects to be selected together or projects mutually exclusive. The proposed portfolio selection methodology can be applied in different contexts. We present an application in the urban planning domain where our approach allows to select a set of urban projects on the basis of their priority, budgetary constraints and urban policy requirements. Given the increasing interest of historical cities to reuse their cultural heritage, we applied and tested our methodology in this context. In particular, we show how the methodology can support the prioritization of the interventions on buildings with some historical value in the historic city center of Naples (Italy), taking into account several points of view.