Enviaments recents

  • Generic algorithms for the generation of combinatorial objects 

    Molinero Albareda, Xavier; Martínez Parra, Conrado (2003-06)
    Report de recerca
    Accés obert
    This report briefly describes our generic approach to the exhaustive generation of unlabelled and labelled combinatorial classes. Our algorithms receive a size n and a finite description of a combinatorial class A using ...
  • An Efficient generic algorithm for the generation of unlabelled cycles 

    Martínez Parra, Conrado; Molinero Albareda, Xavier (2003-06-06)
    Report de recerca
    Accés obert
    In this report we combine two recent generation algorithms to obtain a new algorithm for the generation of unlabelled cycles. Sawada's algorithm lists all k-ary unlabelled cycles with fixed content, that is, the number ...
  • Some advances in the theory of voting systems based on experimental algorithms 

    Freixas Bosch, Josep; Molinero Albareda, Xavier (2006-01)
    Report de recerca
    Accés obert
    In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent structures there is an important problem that consists in determining the weightedness of a voting system by means of trades ...
  • Minimal representations for majority games 

    Freixas Bosch, Josep; Molinero Albareda, Xavier; Roura Ferret, Salvador (2007-02)
    Report de recerca
    Accés obert
    This paper presents some new results about majority games. Isbell (1959) was the first to find a majority game without a minimum normalized representation; he needed 12 voters to construct such a game. Since then, it has ...
  • Bisemivalues, binomial bisemivalues and multilinear extension for bicooperative games 

    Domènech Blázquez, Margarita; Giménez Pradales, José Miguel; Puente del Campo, María Albina (2015-10-05)
    Report de recerca
    Accés obert
    We introduce bisemivalues for bicooperative games and we also provide an interesting characterization of this kind of values by means of weighting coefficients in a similar way than given for semivalues in the context of ...
  • On the complexity of exchanging 

    Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José (2015-03-24)
    Report de recerca
    Accés obert
    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 ...
  • Decisiveness of decisive symmetric games 

    Carreras Escobar, Francisco; Freixas Bosch, Josep; Puente del Campo, María Albina (2011-04-08)
    Report de recerca
    Accés obert
    Binary voting systems, usually represented by simple games, constitute a main DSS topic. A crucial feature of such a system is the easiness with which a proposal can be collectively accepted, which is measured by the ...
  • Symmetric coalitional binomial semivalues 

    Carreras Escobar, Francisco; Puente del Campo, María Albina (2011-02-02)
    Report de recerca
    Accés obert
    We introduce here a family of mixed coalitional values. they extend the binomial semivalues to games endowed with a coalition structure, satisfy the property of symmetry in the quotidient game and the quotient game ...
  • Maximum tolerance and maximum greatest tolerance 

    Freixas Bosch, Josep; Molinero Albareda, Xavier (2009-09-23)
    Report de recerca
    Accés obert
    An important consideration when applying neural networks is the sensitivity to weights and threshold in strict separating systems representing a linearly separable function. Two parameters have been introduced to ...
  • The influence of the node criticality relation on some measures of component importance 

    Freixas Bosch, Josep; Pons Vallès, Montserrat (2009)
    Report de recerca
    Accés restringit per decisió de l'autor
    Estudi de la relació entre diverses mesures d'importància probabilístiques i la relació crítica associada al sistema

Mostra'n més