The VL control measure for symmetric networks
Loading...
Authors
Hendrickx, Ruud
Borm, Peter
Van den Brink, René
Owen, Guillermo
Subjects
Control measure
Search probabilities
Cooperative network game
Proper Shapley value
Matrix search game
Search probabilities
Cooperative network game
Proper Shapley value
Matrix search game
Advisors
Date of Issue
2009
Date
2009
Publisher
Language
en_US
Abstract
In this paper we measure “control” of nodes in a network by solving an associated optimisation problem.
We motivate this so-called VL control measure by giving an interpretation in terms of allocating resources
optimally to the nodes in order to maximise some search probability. We determine the VL control measure
for various classes of networks. Furthermore, we provide two game theoretic interpretations of this
measure. First it turns out that the VL control measure is a particular proper Shapley value of the associated
cooperative network game. Secondly, we relate the measure to optimal strategies in an associated
matrix search game.
Type
Article
Description
The article of record as published may be found at http://dx.doi.org/10.1016/j.socnet.2008.10.004
Series/Report No
Department
Applied Mathematics
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Netherlands Organisation for Scientific Research (NWO)
Funding
Format
8 p.
Citation
Borm, P., Van den Brink, R., Hendrickx, R. & Owen, G. 2009, "The VL control measure for symmetric networks", Social Networks, , pp. 85-91.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.