Power and Core-Periphery Networks

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

6.896: Topics in Algorithmic Game Theory Lecture 21 Yang Cai.
Risk Models and Controlled Mitigation of IT Security R. Ann Miura-Ko Stanford University February 27, 2009.
Collaboration Mechanisms in SOA based MANETs. Introduction Collaboration implies the cooperation between the nodes to support the proper functioning of.
Introduction to Graphs
Internet Based Social Research Introduction Technology and Social Research The Internet & Social Research Some Key Issues Integration, adaptation or.
Effort Games and the Price of Myopia Michael Zuckerman Joint work with Yoram Bachrach and Jeff Rosenschein.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Based on chapter 3 in Networks, Crowds and markets (by Easley and Kleinberg) Roy Mitz Supervised by: Prof. Ronitt Rubinfeld November 2014 Strong and weak.
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Company LOGO 1 Identity and Search in Social Networks D.J.Watts, P.S. Dodds, M.E.J. Newman Maryam Fazel-Zarandi.
Strategic Network Formation With Structural Holes By Jon Kleinberg, Siddharth Suri, Eva Tardos, Tom Wexler.
Ecs289m Spring, 2008 Network Formation S. Felix Wu Computer Science Department University of California, Davis
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
VCG Computational game theory Fall 2010 by Inna Kalp and Yosef Heskia.
Victor Lee.  What are Social Networks?  Role and Position Analysis  Equivalence Models for Roles  Block Modelling.
1 Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA.
Example: Network Formation and Strategic Firm Behaviour to Explore and Exploit Müge Özman Institut Telecom Telecom & Management SudParis DIMETIC 2009 Strasbourg.
Complexity of Determining Nonemptiness of the Core Vincent Conitzer, Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Equilibria in Network Games: At the Edge of Analytics and Complexity Rachel Kranton Duke University Research Issues at the Interface of Computer Science.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
Enhancing service system design : An entity interaction pattern approach Author : Soe-Tsyr Daphne Yuan, Shiou-Tian Hsu Professor : Soe-Tsyr Daphne Yuan.
Introduction Many organizations use decision rules to alleviate incentive problems as opposed to incentive contracts The principal typically retains some.
Hedonic Clustering Games Moran Feldman Joint work with: Seffi Naor and Liane Lewin-Eytan.
Clubs and Social Networks Chaim Fershtman and Dotan Persitz Eitan Berglas School of Economics in Tel Aviv University CTN, Marseille, June 2010.
Sporadic model building for efficiency enhancement of the hierarchical BOA Genetic Programming and Evolvable Machines (2008) 9: Martin Pelikan, Kumara.
Internet Economics כלכלת האינטרנט Class 9 – social networks (based on chapter 3 from Easely & Kleinberg’s books) 1.
Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
Lecture 1: Networks: A brief introduction Sudipta Sarangi Virginia Tech.
Coalitional Games on “Sparse” Social Networks Edith Elkind University of Oxford.
Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains Vincent Conitzer, Tuomas Sandholm Computer.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Network Theory 11/29/2012.
Alan P. Reynolds*, David W. Corne and Michael J. Chantler
Complexity of Determining Nonemptiness of the Core
Groups of vertices and Core-periphery structure
Sofus A. Macskassy Fetch Technologies
Risk aversion and networks Microfoundations for network formation
Introduction to e-Commerce
Lecture 1: Introduction CS 765: Complex Networks
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
What is good design?.
CPS Cooperative/coalitional game theory
Real Options: Taking Stock and Looking Ahead
Centralities (2) Ralucca Gera,
On a Network Creation Game
Revisiting the Bright and Dark Sides of Capital Flows in Business Groups Written by:Joseph P. H. Fan,Li Jin & Guojian Zheng 王锦
V11 Metabolic networks - Graph connectivity
Introduction Wireless Ad-Hoc Network
GODFREY HODGSON HOLMES TARCA
Cyber Physical Systems
Markov Random Fields Presented by: Vladan Radosavljevic.
Michael Margaliot School of Elec. Eng. -Systems
Formation of Community-based Multi-hop Wireless Access Networks
Oliver Schulte Petra Berenbrink Simon Fraser University
Miniconference on the Mathematics of Computation
Network Planning & Capacity Management
V11 Metabolic networks - Graph connectivity
Network Planning & Capacity Management
The Price of Routing Unsplittable Flow
Network Planning & Capacity Management
Affiliation Network Models of Clusters in Networks
V11 Metabolic networks - Graph connectivity
Information, Incentives, and Mechanism Design
Informal Creditors and Sovereign Debt Restructuring
Blockchain Mining Games
Presentation transcript:

Power and Core-Periphery Networks Dotan Persitz June 2011

Introduction Why do core-periphery networks emerge? Strategic network formation model with heterogeneous agents.

Core-periphery networks - definition In a core-periphery network the nodes can be partitioned into two subsets: Core – every two agents are connected. Periphery – every two agents are disconnected. No restriction on the links between the core and the periphery. Various definitions in the literature. Graph Theory: split graphs (Foldes & Hammer (1977)). Sociology: Borgatti & Everett (1999). Economics: Bramoulle & Kranton (2005) and Bramoulle (2007).

Core-periphery networks - definition

Real world core-periphery networks Frequent (White et al. (1976)). Geographical networks: Highways, streets, airports and hardwired internet (Holme (2005)) Social networks: Scientific collaboration networks (Mullins et al. (1977), van der Leij & Goyal (2009), Moody (2004)). Drug users (Curtis et. al. (1995)). Industrial Networks: Interlocking directorates (Mintz & Schwartz (1981), Davis et al. (2003)). Research collaboration (Baker et al. (2008)).

Pharmaceutical-biotech alliances

Core-periphery networks – observation Mullins et al. (1977):

Possible story Consider a set of agents that form a network. Once in a while, one of the agents comes up with an innovative idea. Other agents get the information regarding this new idea through the network, with a delay (increases with the distance from the source). There are two types of agents - “superior” and “inferior”. The probability that a “superior” agent will come up with a new idea is higher than the probability that an “inferior” agent will do so. Also, “superior” agents are more able than “inferior” agents in exploiting new ideas. In any other respect, the two types are identical. It is more beneficial to be linked to a “superior” agent (directly or indirectly). A “superior” agent benefits more than an “inferior” agent from any given path.

The Model n individuals in the social network. Two types of agents: The type of an agent will be denoted by agents of type a. agents of type b.

The Model The utility of agent i: The intrinsic value function:

The intrinsic value function The values are positive. Interpretation: Power-based preferences: . Homophilic preferences: . Heterophilic preferences: . Jackson and Wolinsky (1996) preferences: .

The Model – solution concepts

Core Periphery networks – classification

Results Characterization of the architecture under power-based preferences (stability and efficiency). Fix the depreciation rate and the intrinsic value function and increase the linking costs. AB-CP network is a core-periphery network in which: All the core agents are of type a All the periphery agents are of type b

Extremely low linking costs The architecture does not reflect any heterogeneity.

Low linking costs The type a agents acquire better position: Very connected among themselves. Serve as bridges for the type b agents.

Strong power-based preferences Restrictions on the agents’ linking preferences: Type a agents: . Type b agents: . In partially strong power-based preferences only the first holds. Trade-off between decay and heterogeneity. Decay gives an incentive to connect with “distant” agents. Decay is a function of the decay factor and the distance. Heterogeneity gives an incentive to connect with type a agents.

Medium linking costs

The Heterogeneous Connections Model

High linking costs

Q What is Q? In Jackson and Wolinsky (1996) – the case of : Let g be AB-DisCP and let g’ be the AB-OGMinCP network. The net benefits per payment from moving from g to g’ is: In Jackson and Wolinsky (1996) – the case of : The net benefits per payment from moving from the empty network to the star network is . Q is interesting, but not a result of introducing heterogeneity.

Proposition 4 – proof (flavor) AB-DisCP is pairwise stable by the linking costs range. Efficiency: Type a agents form a clique (positive externalities). AB-OGMinCP is the best among the connected. Type b agents which are not in the main component are isolates. Either AB-DisCP or AB-OGMinCP is the best among the remaining candidates. Q determines the efficient network. Uniqueness when Q is negative: Type a agents form a clique. A general result: in a pairwise stable network each agent has non-negative utility. Assume there is another pairwise stable network. Then, it must have higher total utility than AB-DisCP. Contradiction.

Extremely high linking costs A-stars, AB-stars and the empty network dominate this extreme range of costs.

Issues Homophily and Heterophily. More complex architectures: Semi periphery: Weakening Assumption 1. Introducing a third type. Introducing simple linking costs heterogeneity. Multiple peripheries: Distinguishing the advantages of ‘superior agents’. Stability concepts. Pairwise Nash. Calvo-Armengol & Ilkilic (2009). “Switch”. Needs some form of “farsighted” notion. The formation process.

Conclusions Core periphery structures are frequent in the “world”. “Power-based” linking preferences are suggested as a possible explanation for the emergence of such architectures. Such social preferences may deepen inequality by granting an additional positional advantage to the already exogenously privileged.

Go Canucks Go !!!