Manuel García, Conrado Miguel

Profile Picture
First Name
Conrado Miguel
Last Name
Manuel García
Universidad Complutense de Madrid
Faculty / Institute
Estudios estadísticos
Estadística y Ciencia de los Datos
Estadística e Investigación Operativa
UCM identifierORCIDScopus Author IDWeb of Science ResearcherIDDialnet ID

Search Results

Now showing 1 - 7 of 7
  • Publication
    A social Capital Index
    (2012-01) Manuel García, Conrado Miguel
    In this paper it propose a social capital measure for individuals belonging to a social network. to do this, It uses a game theoretical approach and so it suppose that these indivuduals are involved in a cooperative TU-game modelling the economic or social interest that motivate their interest.
  • Publication
    Values of games with weighted graphs
    (Facultad de Estudios Estadísticos, 2014) González-Arangüena, Enrique; Manuel García, Conrado Miguel; Pozo, M. del
    In this paper we deal with TU games in which cooperation is restricted by means of a weighted network. We admit several interpretations for the weights of a link: capacity of the communication channel, flow across it, intimacy or intensity in the relation, distance between both incident nodes/players, cost of building or main-taining the communication link or even probability of the relation (as in Calvo et al., 1999). Then, accordingly with the different interpretations, we introduce several point solutions for these restricted games in a parallel way to the familiar environ of Myerson. Finally, we characterize these values in terms of the (adapted) component efficiency, fairness and balanced contributions properties and we analyze the extend to which they satisfy the stability property.
  • Publication
    Splitting graphs when calculating Myerson value for pure overhead games
    (Springer, 2004-07) González-Arangüena, Enrique; Manuel García, Conrado Miguel; Owen, Guillermo; Pozo, M. del; Tejada Cazorla, Juan Antonio
    A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results which extend those well known for trees and cycle-complete graphs. On the other hand, in order to reduce the associated calculus for communication situations with a pure overhead game, the possibility of splitting the graph in several subgraphs is analyzed. For each fixed decomposition of the graph, a subspace of games compatible with this decomposition is given.
  • Publication
    Reciprocal cooperation in the prisoner’s dilemma repeated with random horizon
    (Springer, 1995) Manuel García, Conrado Miguel; Tejada Cazorla, Juan Antonio
    A standard assumption on the Iterated Prisoner’s Dilemma is that the probability of further interaction is constant. Then, cooperation via reciprocity can be guaranteed if and only if this probability is sufficiently high. In this paper, we analyze a more realistic model: a discrete random variable, not necessarily geometric, governs the number of interactions. We obtain necessary conditions and sufficient conditions for reciprocal cooperation based on the use of TFT strategy by both players. The obtained conditions are particularized to classes of distributions with monotonous failure rate and to some relevant probability models.
  • Publication
    Game theory and centrality in directed social networks
    (2011-03) Del Pozo, Mónica; Manuel García, Conrado Miguel; González-Arangüena, Enrique; Owen, Guillermo
  • Publication
    A probabilistic position value
    (2009) Ghintran, Amandine; González Arangüena, Enrique; Manuel García, Conrado Miguel
    In this article the authors generalize the position value, defined by Meessen (1988) for the class of deterministic communication situations, to the class of generalized probabilistic communication situation (Gómez et al.)They provide two characterization of this new allocation rule, They characterize the probabilistic position value using probabilistic version of component efficiency and balanced link contribution. The They generalize the notion of link potential, defined by Slikker for the class of deterministic communication situations, to the class of generalizad probabilistic commnication situations, and use it charasterized their allocation rules. Finally, They show that these two characterizations are logically equivalent.
  • Publication
    Marginality and the position value
    (Springer, 2022-10-08) Manuel García, Conrado Miguel; Ortega Castello, Eduardo; Pozo, M. del
    We present a new characterization of the position value, one of the most prominent allocation rules for communication situations (graph-games or games with restricted communication). This characterization includes the PL-marginality property, an extension for communications situations of the classic marginality for TU-games, as well as component efficiency and balanced link contributions for necessary players.