Electre Methods: Main Features and Recent Developments

We present main characteristics of Electre family methods, designed for multiple criteria decision aiding. These methods use as a preference model an outranking relation in the set of actions - it is constructed in result of concordance and non-discordance tests involving a specific input preference information. After a brief description of the constructivist conception in which the Electre methods are inserted, we present the main features of these methods. We discuss such characteristic features as: the possibility of taking into account positive and negative reasons in the modeling of preferences, without any need for recoding the data; using of thresholds for taking into account the imperfect knowledge of data; the absence of systematic compensation between "gains" and "losses". The main weaknesses are also presented. Then, some aspects related to new developments are outlined. These are related to some new methodological developments, new procedures, axiomatic analysis, software tools, and several other aspects. The paper ends with conclusions

Reasons and Means to Model Preferences as Incomplete

Literature involving preferences of artificial agents or human beings often assume their preferences can be represented using a complete transitive binary relation. Much has been written however on different models of preferences. We review some of the reasons that have been put forward to justify more complex modeling, and review some of the techniques that have been proposed to obtain models of such preferences

Decision-Making Ontology for Information System Engineering

International audienceInformation Systems (IS) engineering (ISE) processes contain steps where decisions must be made. Moreover, the growing role of IS in organizations involves requirements for ISE such as quality, cost and time. Considering these aspects implies that the number of researches dealing with decision-making (DM) in ISE increasingly grows. As DM becomes widespread in the ISE field, it is necessary to build a representation, shared between researchers and practitioners, of DM concepts and their relations with DM problems in ISE. In this paper, we present a DM ontology which aims at formalizing DM knowledge. Its goal is to enhance DM and to support DM activities in ISE. This ontology is illustrated within the requirements engineering field

Discovery of AZD3199, an inhaled ultralong acting β2 receptor agonist with rapid onset of action

A series of dibasic des-hydroxy β2 receptor agonists has been prepared and evaluated for potential as inhaled ultra-long acting bronchodilators. Determination of activities at the human β-adrenoreceptors demonstrated a series of highly potent and selective β2 receptor agonists that were progressed to further study in a guinea pig histamine-induced bronchoconstriction model. Following further assessment by; onset studies in guinea pig tracheal rings and human bronchial rings contracted with methacholine (guinea pigs) or carbachol (humans), duration of action studies in guinea pigs after intratracheal (i. t.) administration and further selectivity and safety profiling AZD3199 was shown to have an excellent over all profile and was progressed into clinical evaluation as a new ultra-long acting inhaled β2 receptor agonist with rapid onset of action

Le Genévrier thurifère, espèce partagée au nord et au sud de la Méditerranée

Le 4e colloque sur le Genévrier thurifère (octobre 2011), a été l’occasion de partager les connaissances, les expériences et les avancées scientifiques sur cette espèce partagée au Sud et au Nord de la Méditerranée... Une approche pluridisciplinaire, des sciences humaines et sociales aux sciences biologiques… et médicales a permis de montrer les relations très fortes que cet arbre entretient, depuis des siècles, avec l’Homme, mais aussi la confrontation entre des préoccupations de gestion et des préoccupations de recherche plus fondamentales. Cet article est la synthèse du colloque

Aggregation of measures to produce an overall assessment of animal welfare. Part 1: a review of existing methods

Several systems have been proposed for the overall assessment of animal welfare at the farm level for the purpose of advising farmers or assisting public decision-making. They are generally based on several measures compounded into a single evaluation, using different rules to assemble the information. Here we discuss the different methods used to aggregate welfare measures and their applicability to certification schemes involving welfare. Data obtained on a farm can be (i) analysed by an expert who draws an overall conclusion; (ii) compared with minimal requirements set for each measure; (iii) converted into ranks, which are then summed; or (iv) converted into values or scores compounded in a weighted sum (e.g. TGI35L) or using ad hoc rules. Existing methods used at present (at least when used exclusively) may be insufficiently sensitive or not routinely applicable, or may not reflect the multidimensional nature of welfare and the relative importance of various welfare measures. It is concluded that different methods may be used at different stages of the construction of an overall assessment of animal welfare, depending on the constraints imposed on the aggregation proces

Robust Bounds on Choosing from Large Tournaments

Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out any alternative in large random tournaments. Nevertheless, all analytical results thus far have assumed a rigid probabilistic model, in which either a tournament is chosen uniformly at random, or there is a linear order of alternatives and the orientation of all edges in the tournament is chosen with the same probabilities according to the linear order. In this work, we consider a significantly more general model where the orientation of different edges can be chosen with different probabilities. We show that a number of common tournament solutions, including the top cycle and the uncovered set, are still unlikely to rule out any alternative under this model. This corresponds to natural graph-theoretic conditions such as irreducibility of the tournament. In addition, we provide tight asymptotic bounds on the boundary of the probability range for which the tournament solutions select all alternatives with high probability.Comment: Appears in the 14th Conference on Web and Internet Economics (WINE), 201