GRTJ - Grup de Recerca en Teoria de Jocs
http://hdl.handle.net/2117/3429
Fri, 15 Dec 2017 19:44:48 GMT2017-12-15T19:44:48ZA note on multinomial probabilistic values
http://hdl.handle.net/2117/111772
A note on multinomial probabilistic values
Carreras Escobar, Francisco; Puente del Campo, María Albina
Multinomial values were previously introduced by one of the authors in reliability and extended later to all cooperative games. Here, we present for this subfamily of probabilistic values three new results, previously stated only for binomial semivalues in the literature. They concern the dimension of the subspace spanned by the multinomial values and two characterizations: one, individual, for each multinomial value; another, collective, for the whole subfamily they form. Finally, an application to simple games is provided
This is a post-peer-review, pre-copyedit version of an article published in "TOP". The final authenticated version is available online at: https://doi.org/10.1007/s11750-017-0464-1
Tue, 12 Dec 2017 12:36:30 GMThttp://hdl.handle.net/2117/1117722017-12-12T12:36:30ZCarreras Escobar, FranciscoPuente del Campo, María AlbinaMultinomial values were previously introduced by one of the authors in reliability and extended later to all cooperative games. Here, we present for this subfamily of probabilistic values three new results, previously stated only for binomial semivalues in the literature. They concern the dimension of the subspace spanned by the multinomial values and two characterizations: one, individual, for each multinomial value; another, collective, for the whole subfamily they form. Finally, an application to simple games is providedCentrality measure in social networks based on linear threshold model
http://hdl.handle.net/2117/111727
Centrality measure in social networks based on linear threshold model
Riquelme Csori, Fabián; Gonzalez Cantergiani, Pablo; Molinero Albareda, Xavier; Serna Iglesias, María José
Centrality and influence spread are two of the most studied concepts in social network analysis. In recent years, centrality measures have attracted the attention of many researchers, generating a large and varied number of new studies about social network analysis and its applications. However, as far as we know, traditional models of influence spread have not yet been exhaustively used to define centrality measures according to the influence criteria. Most of the considered work in this topic is based on the independent cascade model. In this paper we explore the possibilities of the linear threshold model for the definition of centrality measures to be used on weighted and labeled social networks. We propose a new centrality measure to rank the users of the network, the Linear Threshold Rank (LTR), and a centralization measure to determine to what extent the entire network has a centralized structure, the Linear Threshold Centralization (LTC). We appraise the viability of the approach through several case studies. We consider four different social networks to compare our new measures with two centrality measures based on relevance criteria and another centrality measure based on the independent cascade model. Our results show that our measures are useful for ranking actors and networks in a distinguishable way.
Mon, 11 Dec 2017 16:58:45 GMThttp://hdl.handle.net/2117/1117272017-12-11T16:58:45ZRiquelme Csori, FabiánGonzalez Cantergiani, PabloMolinero Albareda, XavierSerna Iglesias, María JoséCentrality and influence spread are two of the most studied concepts in social network analysis. In recent years, centrality measures have attracted the attention of many researchers, generating a large and varied number of new studies about social network analysis and its applications. However, as far as we know, traditional models of influence spread have not yet been exhaustively used to define centrality measures according to the influence criteria. Most of the considered work in this topic is based on the independent cascade model. In this paper we explore the possibilities of the linear threshold model for the definition of centrality measures to be used on weighted and labeled social networks. We propose a new centrality measure to rank the users of the network, the Linear Threshold Rank (LTR), and a centralization measure to determine to what extent the entire network has a centralized structure, the Linear Threshold Centralization (LTC). We appraise the viability of the approach through several case studies. We consider four different social networks to compare our new measures with two centrality measures based on relevance criteria and another centrality measure based on the independent cascade model. Our results show that our measures are useful for ranking actors and networks in a distinguishable way.On the viscoelastic mixtures of solids
http://hdl.handle.net/2117/108907
On the viscoelastic mixtures of solids
Fernández, Jose R.; Magaña Nieto, Antonio; Masid, Maria; Quintanilla de Latorre, Ramón
In this paper we analyze an homogeneous and isotropic mixture of viscoelastic solids. We propose conditions to guarantee the coercivity of the internal energy and also of the dissipation, first in dimension two and later in dimension three. We obtain an uniqueness result for the solutions when the dissipation is positive and without any hypothesis over the internal energy. When the internal energy and the dissipation are both positive, we prove the existence of solutions as well as their analyticity. Exponential stability and impossibility of localization of the solutions are immediate consequences.
The final publication is available at link.springer.com via https://doi.org/10.1007/s00245-017-9439-8
Fri, 20 Oct 2017 10:49:05 GMThttp://hdl.handle.net/2117/1089072017-10-20T10:49:05ZFernández, Jose R.Magaña Nieto, AntonioMasid, MariaQuintanilla de Latorre, RamónIn this paper we analyze an homogeneous and isotropic mixture of viscoelastic solids. We propose conditions to guarantee the coercivity of the internal energy and also of the dissipation, first in dimension two and later in dimension three. We obtain an uniqueness result for the solutions when the dissipation is positive and without any hypothesis over the internal energy. When the internal energy and the dissipation are both positive, we prove the existence of solutions as well as their analyticity. Exponential stability and impossibility of localization of the solutions are immediate consequences.Combinatorial structures to modeling simple games and applications
http://hdl.handle.net/2117/107881
Combinatorial structures to modeling simple games and applications
Molinero Albareda, Xavier
We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures (from the viewpoint of structures or graphs). Second, we formally define molecules as combinations of atoms. It let us to modeling molecules as combinatorial structures (from the viewpoint of combinations). It is open to generate such combinatorial structures using some specific techniques as genetic algorithms, (meta-)heuristics algorithms and parallel programming, among others.
Thu, 21 Sep 2017 15:31:46 GMThttp://hdl.handle.net/2117/1078812017-09-21T15:31:46ZMolinero Albareda, XavierWe connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures (from the viewpoint of structures or graphs). Second, we formally define molecules as combinations of atoms. It let us to modeling molecules as combinatorial structures (from the viewpoint of combinations). It is open to generate such combinatorial structures using some specific techniques as genetic algorithms, (meta-)heuristics algorithms and parallel programming, among others.On the characterization of weighted simple games
http://hdl.handle.net/2117/107644
On the characterization of weighted simple games
Freixas Bosch, Josep; Freixas Boleda, Marc; Kurz, Sascha
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main purposes in both theories is to determine when a simple game is representable as a weighted game, which allows a very compact and easily comprehensible representation. Deep results were found in threshold logic in the sixties and seventies for this problem. However, game theory has taken the lead and some new results have been obtained for the problem in the past two decades. The second and main goal of this paper is to provide some new results on this problem and propose several open questions and conjectures for future research. The results we obtain depend on two significant parameters of the game: the number of types of equivalent players and the number of types of shift-minimal winning coalitions.
The final publication is available at link.springer.com via http://dx.doi.org/10.1007/s11238-017-9606-z
Thu, 14 Sep 2017 17:51:00 GMThttp://hdl.handle.net/2117/1076442017-09-14T17:51:00ZFreixas Bosch, JosepFreixas Boleda, MarcKurz, SaschaThis paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main purposes in both theories is to determine when a simple game is representable as a weighted game, which allows a very compact and easily comprehensible representation. Deep results were found in threshold logic in the sixties and seventies for this problem. However, game theory has taken the lead and some new results have been obtained for the problem in the past two decades. The second and main goal of this paper is to provide some new results on this problem and propose several open questions and conjectures for future research. The results we obtain depend on two significant parameters of the game: the number of types of equivalent players and the number of types of shift-minimal winning coalitions.Separability by semivalues modified for games with coalition structure
http://hdl.handle.net/2117/105390
Separability by semivalues modified for games with coalition structure
Amer Ramon, Rafael; Giménez Pradales, José Miguel
Two games are inseparable by semivalues if both games obtain the same allocation whatever semivalue is considered. The problem of separability by semivalues reduces to separability from the null game. For four or more players, the vector subspace of games inseparable from the null game by semivalues contains games different to zero-game. Now, for five or more players, the consideration of a priori coalition blocks in the player set allows us to reduce in a significant way the dimension of the vector subspace of games inseparable from the null game. For these subspaces we provide basis formed by games of a particular type.
The original publication is available at www.rairo-ro.org
Tue, 13 Jun 2017 15:21:57 GMThttp://hdl.handle.net/2117/1053902017-06-13T15:21:57ZAmer Ramon, RafaelGiménez Pradales, José MiguelTwo games are inseparable by semivalues if both games obtain the same allocation whatever semivalue is considered. The problem of separability by semivalues reduces to separability from the null game. For four or more players, the vector subspace of games inseparable from the null game by semivalues contains games different to zero-game. Now, for five or more players, the consideration of a priori coalition blocks in the player set allows us to reduce in a significant way the dimension of the vector subspace of games inseparable from the null game. For these subspaces we provide basis formed by games of a particular type.Using the multilinear extension to study some probabilistic power indices
http://hdl.handle.net/2117/104580
Using the multilinear extension to study some probabilistic power indices
Freixas Bosch, Josep; Pons Vallès, Montserrat
We consider binary voting systems modeled by a simple game, in which voters vote independently of each other, and the probability distribution over coalitions is known. The Owen’s multilinear extension of the simple game is used to improve the use and the computation of three indices defined in this model: the decisiveness index, which is an extension of the Banzhaf index, the success index, which is an extension of the Rae index, and the luckiness index. This approach leads us to prove new properties and inter-relations between these indices. In particular it is proved that the ordinal equivalence between success and decisiveness indices is achieved in any game if and only if the probability distribution is anonymous. In the anonymous case, the egalitarianism of the three indices is compared, and it is also proved that, for these distributions, decisiveness and success indices respect the strength of the seats, whereas luckiness reverses this order.
The final publication is available at Springer via http://dx.doi.org/10.1007/s10726-016-9514-6
Wed, 17 May 2017 14:32:45 GMThttp://hdl.handle.net/2117/1045802017-05-17T14:32:45ZFreixas Bosch, JosepPons Vallès, MontserratWe consider binary voting systems modeled by a simple game, in which voters vote independently of each other, and the probability distribution over coalitions is known. The Owen’s multilinear extension of the simple game is used to improve the use and the computation of three indices defined in this model: the decisiveness index, which is an extension of the Banzhaf index, the success index, which is an extension of the Rae index, and the luckiness index. This approach leads us to prove new properties and inter-relations between these indices. In particular it is proved that the ordinal equivalence between success and decisiveness indices is achieved in any game if and only if the probability distribution is anonymous. In the anonymous case, the egalitarianism of the three indices is compared, and it is also proved that, for these distributions, decisiveness and success indices respect the strength of the seats, whereas luckiness reverses this order.On alpha-roughly weighted games
http://hdl.handle.net/2117/103235
On alpha-roughly weighted games
Freixas Bosch, Josep; Kurz, Sascha
Very recently Gvozdeva, Hemaspaandra, and Slinko (2011) h
ave introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of weighted voting games or roughly weighted voting games. Their third class C aconsists of all simple games
permitting a weighted representation such that each winnin
g coalition has a weight of at least 1 and each losing coalition a weight of at most a. We continue their work and contribute some new results on the possible values of a for a given number of voters.
Mon, 03 Apr 2017 15:53:36 GMThttp://hdl.handle.net/2117/1032352017-04-03T15:53:36ZFreixas Bosch, JosepKurz, SaschaVery recently Gvozdeva, Hemaspaandra, and Slinko (2011) h
ave introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of weighted voting games or roughly weighted voting games. Their third class C aconsists of all simple games
permitting a weighted representation such that each winnin
g coalition has a weight of at least 1 and each losing coalition a weight of at most a. We continue their work and contribute some new results on the possible values of a for a given number of voters.The complexity of testing properties of simple games
http://hdl.handle.net/2117/103171
The complexity of testing properties of simple games
Freixas Bosch, Josep; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea'' votes yield passage of the issue at hand. A collection of ``yea'' voters forms a winning coalition.
We are interested on performing a complexity analysis of problems on such games depending on the game representation. We consider four natural explicit representations, winning, loosing, minimal winning, and maximal loosing. We first analyze the computational complexity of obtaining a particular representation of a simple game from a different one. We show that some cases this transformation can be done in polynomial time while the others require exponential time. The second question is classifying the complexity for testing whether a game is simple or weighted. We show that for the four types of representation both problem can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. In this way, we analyze strongness, properness, decisiveness and homogeneity, which are desirable properties to be fulfilled for a simple game.
Fri, 31 Mar 2017 15:48:07 GMThttp://hdl.handle.net/2117/1031712017-03-31T15:48:07ZFreixas Bosch, JosepMolinero Albareda, XavierOlsen, MartinSerna Iglesias, María JoséSimple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea'' votes yield passage of the issue at hand. A collection of ``yea'' voters forms a winning coalition.
We are interested on performing a complexity analysis of problems on such games depending on the game representation. We consider four natural explicit representations, winning, loosing, minimal winning, and maximal loosing. We first analyze the computational complexity of obtaining a particular representation of a simple game from a different one. We show that some cases this transformation can be done in polynomial time while the others require exponential time. The second question is classifying the complexity for testing whether a game is simple or weighted. We show that for the four types of representation both problem can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. In this way, we analyze strongness, properness, decisiveness and homogeneity, which are desirable properties to be fulfilled for a simple game.Weighted voting, abstention and multiple levels of approval
http://hdl.handle.net/2117/103170
Weighted voting, abstention and multiple levels of approval
Freixas Bosch, Josep; Zwicker, William S.
In this paper we introduce the class of simple games with several ordered levels of approval in the input and in the output – the ( j,k) simple games – and propose a definition for weighted games in this context. Abstention is treated as a level of input approval intermediate to votes of yes and no. Our main theorem provides a combinatorial characterization, in terms of what we call grade trade robustness, of weighted ( j,k) games within the class of all ( j,k) simple games. We also introduce other subclasses of ( j,k) simple games and classify several examples. For example, we show the existence of a weighted representation for the UNSC, seen as a voting system in which abstention is permitted.
Research partially supported by Grant 1999BEAI400096 of the Commissioner for Universities and Research of the Catalonia Generalitat and by Grant BFM 2000–0968 of the Spanish Ministry of Science and Technology. The authors would like to thank Larry Becker, Clifford Brown, Vin Moscardelli, and Fred Jonas for their assistance. Extensive remarks by Moshé Machover as well as comments by an anonymous referee greatly improved the manuscript.
The final publication is available at Springer via http://dx.doi.org/10.1007/s00355-003-0212-3.
Fri, 31 Mar 2017 15:30:18 GMThttp://hdl.handle.net/2117/1031702017-03-31T15:30:18ZFreixas Bosch, JosepZwicker, William S.In this paper we introduce the class of simple games with several ordered levels of approval in the input and in the output – the ( j,k) simple games – and propose a definition for weighted games in this context. Abstention is treated as a level of input approval intermediate to votes of yes and no. Our main theorem provides a combinatorial characterization, in terms of what we call grade trade robustness, of weighted ( j,k) games within the class of all ( j,k) simple games. We also introduce other subclasses of ( j,k) simple games and classify several examples. For example, we show the existence of a weighted representation for the UNSC, seen as a voting system in which abstention is permitted.
Research partially supported by Grant 1999BEAI400096 of the Commissioner for Universities and Research of the Catalonia Generalitat and by Grant BFM 2000–0968 of the Spanish Ministry of Science and Technology. The authors would like to thank Larry Becker, Clifford Brown, Vin Moscardelli, and Fred Jonas for their assistance. Extensive remarks by Moshé Machover as well as comments by an anonymous referee greatly improved the manuscript.