The Key Player Problem

12 Pages Posted: 23 Jun 2008

See all articles by Steve Borgatti

Steve Borgatti

University of Kentucky; LINKS Center

Date Written: September 21, 2002

Abstract

The key player problem (KPP) consists of two separate sub-problems, which can be described at a general level as follows:

1. (KPP-1) Given a social network, find a set of k nodes (called a kp-set of order k) which, if removed, would maximally disrupt communication among the remaining nodes.

2. (KPP-2) Given a social network, find a kp-set of order k that is maximally connected to all other nodes.

Keywords: group centrality, fragmentation, disrupt, influence, social network

Suggested Citation

Borgatti, Steve, The Key Player Problem (September 21, 2002). Available at SSRN: https://ssrn.com/abstract=1149843 or http://dx.doi.org/10.2139/ssrn.1149843

Steve Borgatti (Contact Author)

University of Kentucky ( email )

550 South Limestone
Lexington, KY 40506
United States

HOME PAGE: http://www.analytictechcom/borgatti

LINKS Center ( email )

455P Gatton College of Business and Economics Bldg
Lexington, KY 40506-0034
United States

HOME PAGE: http://www.linkscenter.org/

Register to save articles to
your library

Register

Paper statistics

Downloads
243
Abstract Views
1,634
rank
124,128
PlumX Metrics