Главная

Laia Saumell

  1. A general method for deciding about logically constrained issues.

    Пт, 07/16/2010 - 15:01 — SomNambul
    Authors: Rosa Camps, Xavier Mora, Laia Saumell
    Subjects: Artificial Intelligence
    Abstract

    A general method is given for revising degrees of belief and arriving at
    consistent decisions about a system of logically constrained issues. In
    contrast to other works about belief revision, here the constraints are assumed
    to be fixed. The method has two variants, dual of each other, whose revised
    degrees of belief are respectively above and below the original ones. The upper
    [resp. lower] revised degrees of belief are uniquely characterized as the
    lowest [resp. highest] ones that are invariant by a certain max-min [resp.
    min-max] operation determined by the logical constraints.

  2. Fraction-like rates for preferential voting.

    Пнд, 01/25/2010 - 16:01 — SomNambul
    Authors: Rosa Camps, Xavier Mora, Laia Saumell
    Subjects: Combinatorics
    Abstract

    A method is given for determining a mixed social choice out of a
    paired-comparison matrix. The method combines a projection procedure introduced
    in previous papers of the same authors and a classical method due to Zermelo.
    The resulting method is proved to have certain desirable properties, which
    include: compliance with a majority principle, clone consistency, and
    continuity of the mixing fractions with respect to the data.

  3. A continuous rating method for preferential voting. The incomplete case.

    Пнд, 12/14/2009 - 16:01 — SomNambul
    Authors: Rosa Camps, Xavier Mora, Laia Saumell
    Subjects: Optimization and Control
    Abstract

    A method is given for quantitatively rating the social acceptance of
    different options which are the matter of a preferential vote. In contrast to a
    previous article, here the individual votes are allowed to be incomplete, that
    is, they need not express a comparison between every pair of options. This
    includes the case where each voter gives an ordered list restricted to a subset
    of most preferred options. In this connection, the proposed method (except for
    one of the given variants) carefully distinguishes a lack of information about
    a given pair of options from a proper tie between them.

  4. A continuous rating method for preferential voting. The complete case.

    Пнд, 12/14/2009 - 16:01 — SomNambul
    Authors: Rosa Camps, Xavier Mora, Laia Saumell
    Subjects: Optimization and Control
    Abstract

    A method is given for quantitatively rating the social acceptance of
    different options which are the matter of a complete preferential vote.
    Completeness means that every voter expresses a comparison (a preference or a
    tie) about each pair of options. The proposed method is proved to have certain
    desirable properties, which include: compliance with a majority principle,
    clone consistency, and continuity of the rates with respect to the data. One
    can view this method as a quantitative complement for a qualitative method
    introduced in 1997 by Markus Schulze.

Math-arch

RSS-материал