50 research outputs found
Metric and latticial medians
This paper presents the -linked- notions of metric and latticial medians and it explains what is the median procedure for the consensus problems, in particular in the case of the aggregation of linear orders. First we consider the medians of a v-tuple of arbitrary or particular binary relations.. Then we study in depth the difficult (in fact NP-difficult) problem of finding the median orders of a profile of linear orders. More generally, we consider the medians of v-tuples of elements of a semilattice and we describe the median semilattices, i.e. the semilattices were medians are easily computable.Ce texte présente les notions -reliées- de médianes métriques et latticielles et explique le rôle de la procédure médiane dans les problèmes de consensus, notamment dans le cas de l'agrégation d'ordres totaux.. Après avoir étudié les médianes d'un v-uple de relations binaires arbitraires ou particulières, on étudie en détail le problème -difficile (NP-difficile)- d'obtention des ordres médians d'un profil d'ordres totaux. Plus généralement on considère les médianes de v-uples d'éléments d'un demi-treillis (ou d'un treillis) et l'on décrit les demi-treillis à médianes,i.e. ceux où l'obtention des médianes est aisée
Consensus theories: an oriented survey
This article surveys seven directions of consensus theories: Arrowian results, federation consensus rules, metric consensus rules, tournament solutions, restricted domains, abstract consensus theories, algorithmic and complexity issues. This survey is oriented in the sense that it is mainly – but not exclusively – concentrated on the most significant results obtained, sometimes with other searchers, by a team of French searchers who are or were full or associate members of the Centre d'Analyse et de Mathématique Sociale (CAMS).Consensus theories ; Arrowian results ; aggregation rules ; metric consensus rules ; median ; tournament solutions ; restricted domains ; lower valuations ; median semilattice ; complexity
Consensus theories: an oriented survey
URL des Documents de travail : http://ces.univ-paris1.fr/cesdp/cesdp2010.htmlDocuments de travail du Centre d'Economie de la Sorbonne 2010.57 - ISSN : 1955-611XThis article surveys seven directions of consensus theories: Arrowian results, federation consensus rules, metric consensus rules, tournament solutions, restricted domains, abstract consensus theories, algorithmic and complexity issues. This survey is oriented in the sense that it is mainly – but not exclusively – concentrated on the most significant results obtained, sometimes with other searchers, by a team of French searchers who are or were full or associate members of the Centre d'Analyse et de Mathématique Sociale (CAMS).Cet article présente une vue d'ensemble de sept directions de recherche en théorie du consensus : résultats arrowiens, règles d'agrégation définies au moyen de fédérations, règles définies au moyen de distances, solutions de tournoi, domaines restreints, théories abstraites du consensus, questions de complexité et d'algorithmique. Ce panorama est orienté dans la mesure où il présente principalement – mais non exclusivement – les travaux les plus significatifs obtenus – quelquefois avec d'autres chercheurs – par une équipe de chercheurs français qui sont – ou ont été – membres pléniers ou associés du Centre d'Analyse et de Mathématique Sociale (CAMS)
Mining Complex Hydrobiological Data with Galois Lattices
We have used Galois lattices for mining hydrobiological data. These data are
about macrophytes, that are macroscopic plants living in water bodies. These
plants are characterized by several biological traits, that own several
modalities. Our aim is to cluster the plants according to their common traits
and modalities and to find out the relations between traits. Galois lattices
are efficient methods for such an aim, but apply on binary data. In this
article, we detail a few approaches we used to transform complex
hydrobiological data into binary data and compare the first results obtained
thanks to Galois lattices
Some order dualities in logic, games and choices
We first present the concept of duality appearing in order theory, i.e. the notions of dual isomorphism and of Galois connection. Then, we describe two fundamental dualities, the duality extension/intention associated with a binary relation between two sets, and the duality between implicational systems and closure systems. Finally, we present two "concrete" dualities occuring in social choice and in choice functions theories.antiexchange closure operator, Galois connection, implicational system, path-independent choice function, simple game.
Structure Entropy, Self-Organization, and Power Laws in Urban Street Networks: Evidence for Alexander's Ideas
Easy and intuitive navigability is of central importance in cities. The actual scale-free networking of urban street networks in their topological space, where navigation information is encoded by mapping roads to nodes and junctions to links between nodes, has still no simple explanation. Emphasizing the road-junction hierarchy in a holistic and systematic way leads us to envisage urban street networks as evolving social systems subject to a Boltzmann-mesoscopic entropy conservation. This conservation, which we may interpret in terms of surprisal, ensures the passage from the road-junction hierarchy to a scale-free coherence. To wit, we recover the actual scale-free probability distribution for natural roads in self-organized cities. We obtain this passage by invoking Jaynes's Maximum Entropy principle (statistical physics), while we capitalize on modern ideas of quantification (information physics) and well known results on structuration (lattice theory) to measure the information network entropy. The emerging paradigm, which applies to systems with more intricate hierarchies as actual cities, appears to reflect well the influential ideas on cities of the urbanist Christopher Alexander
Liminaire au n° spécial : Mathématiques discrètes : théories et usages. Numéro en hommage à Bruno Leclerc
LiminaireForewor