Enviaments recents

  • Dimension and codimension of simple games 

    Kurz, Sascha; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José (2016-11-01)
    Article
    Accés restringit per política de l'editorial
    This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with ...
  • Unranking algorithms for combinatorial structures 

    Molinero Albareda, Xavier; Vives Pons, Jordi (2015-12)
    Article
    Accés obert
    We present an implementation of some unlabeled and labeled unranking algorithms for the open-source algebraic combinatorics package MUPAD-COMBINAT of the computer algebra system MUPAD. We have compared our implementation ...
  • The complexity of measuring power in generalized opinion leader decision models 

    Molinero Albareda, Xavier; Serna Iglesias, María José (2016-10)
    Article
    Accés restringit per política de l'editorial
    We analyze the computational complexity of the power measure in models of collective decision: the generalized opinion leader-follower model and the oblivious and non-oblivious infuence models. We show that computing the ...
  • Dimension, egalitarianism and decisiveness of European voting systems 

    Carreras Escobar, Francisco; Freixas Bosch, Josep; Magaña Nieto, Antonio (2016)
    Article
    Accés obert
    An analysis of three major aspects has been carried out that may apply to any of the successive voting systems used for the European Union Council of Ministers, from the first one established in the Treaty of Rome in 1958 ...
  • Pure bargaining problems with a coalition structure 

    Carreras Escobar, Francisco; Owen Salazar, Guillermo (2016-08)
    Article
    Accés restringit per política de l'editorial
    We consider here pure bargaining problems endowed with a coalition structure such that each union is given its own utility. In this context we use the Shapley rule in order to assess the main options available to the agents: ...
  • On the time decay of solutions for non-simple elasticity with voids 

    Liu, Zhuangyi; Magaña Nieto, Antonio; Quintanilla de Latorre, Ramón (Wiley-VCH, 2016-07-01)
    Article
    Accés obert
    In this work we consider the non-simple theory of elastic material with voids and we investigate how the coupling of these two aspects of the material affects the behavior of the solutions. We analyze only two kind of ...
  • Decisiveness indices are semiindices 

    Freixas Bosch, Josep; Pons Vallès, Montserrat (2016-06)
    Article
    Accés restringit per política de l'editorial
    In this note we prove that any decisiveness index, defined for any voter as the probability of him/her being decisive, is a semiindex when the probability distribution over coalitions is anonymous, and it is a semiindex ...
  • Some properties for probabilistic and multinomial (probabilistic) values on cooperative games 

    Domènech Blázquez, Margarita; Giménez Pradales, José Miguel; Puente del Campo, María Albina (2016-01-01)
    Article
    Accés restringit per política de l'editorial
    We investigate the conditions for the coefficients of probabilistic and multinomial values of cooperative games necessary and/or sufficient in order to satisfy some properties, including marginal contributions, balanced ...
  • The cost of getting local monotonicity 

    Freixas Bosch, Josep; Kurz, Sascha (Elsevier, 2016-06-01)
    Article
    Accés restringit per política de l'editorial
    Committees with yes-no-decisions are commonly modeled as simple games and the ability of a member to influence the group decision is measured by so-called power indices. For a weighted game we say that a power index satisfies ...
  • On the complexity of exchanging 

    Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José (2016-02-04)
    Article
    Accés restringit per política de l'editorial
    We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning ...

Mostra'n més