El grup té una experiència de gairebé vint anys en el seu camp d’expertesa, la teoria de jocs i les seves aplicacions, des d’aleshores fins ara el grup ha mantingut una línia creixent tant pel que fa a la producció científica contrastada com al nombre de membres que l’integren. El grup és avui un referent internacional en àrees específiques com ara els sistemes de votació i els jocs cooperatius així com en les seves aplicacions: tecnològiques, econòmiques, polítiques i sociològiques.

Els seus treballs són matemàticament rigorosos i concisos, i els seus membres són bons coneixedors de l’àlgebra, la matemàtica discreta, la probabilitat o la computació. Nombroses situacions extretes de la vida quotidiana els han estimulat a modelitzar, simular i proposar propostes de solució o de millora.

Els seus membres comparteixen nombroses publicacions de prestigi, vetllen per la creixent internacionalització del grup, tenen cura de la formació i divulguen els seus treballs.

http://futur.upc.edu/GRTJ

Research in the foundations and applications of game theory. The main theoretical lines are the following: (a) cooperative games and solution concepts; (b) collective decision-making mechanisms and power indices; (c) restrictions to cooperation; (d) multiplicity of alternatives; and (e) software. The areas of application include economics, political science, sociology, management, industrial scheduling and technologies such as cryptography and reliability.

http://futur.upc.edu/GRTJ

Research in the foundations and applications of game theory. The main theoretical lines are the following: (a) cooperative games and solution concepts; (b) collective decision-making mechanisms and power indices; (c) restrictions to cooperation; (d) multiplicity of alternatives; and (e) software. The areas of application include economics, political science, sociology, management, industrial scheduling and technologies such as cryptography and reliability.

http://futur.upc.edu/GRTJ

Enviaments recents

  • On the construction of high dimensional simple games 

    Olsen, Martin; Kurz, Sascha; Molinero Albareda, Xavier (IOS Press, 2016)
    Text en actes de congrés
    Accés obert
    Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., “yes” and “no”, every voting system can be described by a (monotone) ...
  • 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 ...
  • 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 ...
  • 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 ...

Mostra'n més