"Este trabajo de investigación, fundamentalmente, propone un nuevo modelo para la generalización del iniciado por Myerson (1977). Con este objetivo se analizan estructuras estables para la unión de coaliciones con intersección no vacía, que tienen como caso particular a las situaciones de comunicación. Por otro lado, se establece una estrecha...
-
November 27, 2014 (v1)PublicationUploaded on: December 4, 2022
-
May 16, 2024 (v1)Publication
In this paper, we introduce the position value as a centrality measure to evaluate the relevance of the edges and players in a network, with the additional advantage that this value integrates the degree measure of each player in it. In fact, in the real world, it is particularly important to consider the natural influence of connections of a...
Uploaded on: April 4, 2025 -
March 14, 2018 (v1)Publication
In this paper, we study the problem of node aggregation under different perspectives for increasing PageRank of some nodes of interest. PageRank is one of the parameters used by the search engine Google to determine the relevance of a web page. We focus our attention to the problem of nding the best nodes in the network from an aggregation...
Uploaded on: December 4, 2022 -
May 6, 2021 (v1)Publication
(Discrete) bankruptcy problems associated with apportionment problems have been defined. The authors studied which allocations for apportionment problems have been obtained when (discrete) bankruptcy rules were applied to the associated bankruptcy problems. They have shown that the (dis-crete) constrained equal losses rule coincides with the...
Uploaded on: March 25, 2023 -
April 18, 2017 (v1)Publication
This paper deals with cooperative games in which only certain coalitions are allowed to form. There have been previous models developed to confront the problem of nonfeasible coalitions. Games restricted by a communication graph are games in which the feasible coalitions are those that induce connected subgraphs. Another type of model is...
Uploaded on: March 27, 2023 -
May 24, 2022 (v1)Publication
In this paper, we introduce a novel model of multi-issue bankruptcy problem inspired from a real problem of abatement of emissions of different pollutants in which pollutants can have more than one effect on atmosphere. In our model, therefore, several perfectly divisible goods (estates) have to be allocated among certain set of agents...
Uploaded on: March 25, 2023 -
February 23, 2024 (v1)Publication
Water pollutants can be classified into three categories, each of which includes several classifications of substances. In this paper, we present a methodology based on bankruptcy models to determine the emission limits of polluting substances belonging to more than one category. We model the problem as a multi-issue allocation problem with...
Uploaded on: February 25, 2024 -
July 10, 2019 (v1)Publication
We study the problem of identifying relevant genes in a co-expression network using a (cooperative) game theoretic approach. The Shapley value of a cooperative game is used to asses the relevance of each gene in interaction with the others, and to stress the role of nodes in the periphery of a co-expression network for the regulation of complex...
Uploaded on: March 27, 2023 -
May 26, 2022 (v1)Publication
Centrality measures are used in network analysis to identify the relevant elements in a network. Recently, several centrality measures based on coalitional game theory have been successfully applied to dif ferent kinds of biological networks, such as brain networks, gene networks, and metabolic networks. We propose an approach, using...
Uploaded on: December 4, 2022 -
June 29, 2022 (v1)Publication
Agents participating in different kind of organizations, usually take different positions in some network structure. Two well-known network structures are hierarchies and communication networks. We give an overview of the most common models of communication and hierarchy restrictions in cooperative games, compare different network structures...
Uploaded on: March 25, 2023 -
June 2, 2023 (v1)Publication
This article introduces the Banzhaf and the Banzhaf–Owen values as novel measures of risk analysis of a terrorist attack, determining the most dangerous terrorists in a network. This new approach counts with the advantage of integrating at the same time the complete topology (i.e., nodes and edges) of the network and a coalitional structure on...
Uploaded on: June 3, 2023 -
June 29, 2020 (v1)Publication
En este trabajo se definen algoritmos, basados en funciones generatrices, para calcular el índice de poder de Banzhaf en juegos simples de votación ponderada y en juegos de doble y triple mayoría. La utilización de funciones generatrices permite un cálculo exacto del índice de Banzhaf con una reducción sensible de la complejidad temporal....
Uploaded on: December 4, 2022