Pasar al contenido principal

MODELOS DE ATRIBUCION JUEGO-TEORICOS Y APLICACIONES: REDES SOCIALES, MARKETING Y MACHINE LEARNING

PID2020-116884GB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD COMPLUTENSE DE MADRID

Resultados relacionados

Resultados totales (Incluyendo duplicados): 6
Encontrada(s) 1 página(s)

Docta Complutense
Publicación Artículo científico (JournalArticle)

Calculating the interaction index of a fuzzy measure: A polynomial approach based on sampling

  • Gómez González, Daniel
  • Castro Cantalejo, Javier
  • Gutiérrez García-Pardo, Inmaculada
  • Espínola Vílchez, María Rosario
In this paper we address the problem of fuzzy measures index calculation. On the basis of fuzzy sets, Murofushi and Soneda proposed an interaction index to deal with the relations between two individuals. This index was later extended in a common framework by Grabisch. Both indices are fundamental in the literature of fuzzy measures. Nevertheless, the corresponding calculation still presents a highly complex problem for which no approximation solution has been proposed yet. Then, using a representation of the Shapley based on orders, here we suggest an alternative calculation of the interaction index, both for the simple case of pairs of individuals, and for the more complex situation in which any set could be considered. This alternative representation facilitates the handling of these indices. Moreover, we draw on this representation to define two polynomial methods based on sampling to estimate the interaction index, as well as a method to approximate the generalized version of it. We provide some computational results to test the goodness of the proposed algorithms.
Docta Complutense
Publicación Artículo científico (JournalArticle)

Communication in Weighted Networks: A Game Theoretic Approach

  • Manuel García, Conrado Miguel
  • Martín García, Daniel
  • Gavilán García, Elena del Carmen
In this paper we generalize the allocation rule (point solution or value) known as the mixed value by introducing the weighted mixed value.The proposed solution assigns value in graph games where players, and/or links, have weights representing asymmetries of the players, and different flows, lengths, emotional intensities, trust in the transmission of the information, etc. in the links. We present several characterizations of this value using properties, such as mixed component efficiency, weighted mixed fairness, weighted balanced contributions and weighted balanced link contributions. These properties were inspired by the classical properties used to characterize the Myerson value and the position value.
Docta Complutense
Publicación Artículo científico (JournalArticle)

From fuzzy information to community detection: an approach to social networks analysis with soft information

  • Gutiérrez García-Pardo, Inmaculada
  • Gómez González, Daniel
  • Castro Cantalejo, Javier
  • Espínola Vílchez, María Rosario
On the basis of network analysis, and within the context of modeling imprecision or vague information with fuzzy sets, we propose an innovative way to analyze, aggregate and apply this uncertain knowledge into community detection of real-life problems. This work is set on the existence of one (or multiple) soft information sources, independent of the network considered, assuming this extra knowledge is modeled by a vector of fuzzy sets (or a family of vectors). This information may represent, for example, how much some people agree with a specific law, or their position against several politicians. We emphasize the importance of being able to manage the vagueness which usually appears in real life because of the common use of linguistic terms. Then, we propose a constructive method to build fuzzy measures from fuzzy sets. These measures are the basis of a new representation model which combines the information of a network with that of fuzzy sets, specifically when it comes to linguistic terms. We propose a specific application of that model in terms of finding communities in a network with additional soft information. To do so, we propose an efficient algorithm and measure its performance by means of a benchmarking process, obtaining high-quality results.
Docta Complutense
Publicación Artículo científico (JournalArticle)

A new edge betweenness measure using a game theoretical approach: an application to hierarchical community cetection

  • Espínola Vílchez, María Rosario
  • Gómez González, Daniel
  • Castro Cantalejo, Javier
  • Gutiérrez García-Pardo, Inmaculada
In this paper we formally define the hierarchical clustering network problem (HCNP) as the problem to find a good hierarchical partition of a network. This new problem focuses on the dynamic process of the clustering rather than on the final picture of the clustering process. To address it, we introduce a new hierarchical clustering algorithm in networks, based on a new shortest path betweenness measure. To calculate it, the communication between each pair of nodes is weighed by the importance of the nodes that establish this communication. The weights or importance associated to each pair of nodes are calculated as the Shapley value of a game, named as the linear modularity game. This new measure, (the node-game shortest path betweenness measure), is used to obtain a hierarchical partition of the network by eliminating the link with the highest value. To evaluate the performance of our algorithm, we introduce several criteria that allow us to compare different dendrograms of a network from two point of view: modularity and homogeneity. Finally, we propose a faster algorithm based on a simplification of the node-game shortest path betweenness measure, whose order is quadratic on sparse networks. This fast version is competitive from a computational point of view with other hierarchical fast algorithms, and, in general, it provides better results.
Docta Complutense
Publicación Artículo científico (JournalArticle)

Node centrality based on its edges importance: The Position centrality

  • Lopez, Susana
  • Molina Ferragut, Elisenda
  • Saboyá, Martha
  • Tejada Cazorla, Juan Antonio
We propose a novel family of node centralities in social networks, named family of position centralities, which explicitly takes into account the importance of the links to assess the centrality of the nodes that support them through the Position value (Meessen, 1988). Our proposal shares with the family of Myerson centralities (Gómez et al., 2003) that it is a game-theoretic family of measures that allows to consider the functionality of the network modelled by a symmetric cooperative game. We prove that, like the Myerson centrality measures, every Position centrality measure also satisfies essential properties expected of a centrality measure. We analyse in detail the main differences between the Myerson and the position families of centrality measures. Specifically, we study the differences regarding the connection structures that share dividends and the fairness and stability properties. Along this analysis we consider the case of hub-and-spoke clusters, a prevalent model for studying transportation networks. Finally, a characterisation of the Position Attachment centrality is given, which is the Position centrality obtained when the functionality of the network is modelled by the attachment game. Some comparisons are made with the Attachment centrality introduced by Skibski et al. (2019), which is the analogue member of the family of Myerson centralities.
Docta Complutense
Publicación Artículo científico (JournalArticle)

A Family of Position Values for Directed Communication Situations

  • Manuel García, Conrado Miguel
  • Gavilán García, Elena del Carmen
  • van den Brink, René
In this paper, we define a family of values for directed communication situations that are inspired by the position value. We use the concept of directed communication and related connectedness in directed graphs, under which a coalition of players in a game can only cooperate if these players form a directed path in a directed communication graph. By defining an arc game, which assesses the worth of coalitions of (directed) arcs in generating worth, we allocate the Shapley value payoff of each arc over the nodes incident with this arc, where we allow the head and tail to obtain a different share in this arc payoff. However, the way that the arc payoff is shared over its head and tail is uniform over all arcs. We characterize these values by connection efficiency and a modification of the classical balanced link contributions property for undirected communication situations, discriminating between the roles of the nodes as head and tail.