Paper Info
Title
An algorithm with low computational requirements to constrain the Shapley value in coalitional networks
Abstract
In this paper, we deal with a distributed control scheme for linear systems in which the local controllers work cooperatively whenever the benefits from a control perspective are higher than the corresponding communication requirements. To this end, the network topology may vary with time so that all the communication links with a minor contribution to the overall performance are disconnected. Hence, there is also a change in the overall control law, which must be adapted to the information flows enabled by the network topology. This whole framework can be modeled as a cooperative game, which allows us to apply tools such as the Shapley value to gain an insight into the distributed control problem. In particular, we show an alternative way to impose restrictions on this value by using a more computationally efficient design procedure.
Year
DOI
Venue
2015
10.1109/MED.2015.7158900
Control and Automation
Keywords
Field
DocType
distributed control,game theory,linear systems,network theory (graphs),topology,coalitional networks,communication links,communication requirements,constrained Shapley value,cooperative game,distributed control scheme,information flows,linear systems,local controllers,network topology,overall control law,Coalitional Control,Cooperative Game Theory,Linear Matrix Inequalities,Shapley Value
Mathematical optimization,Algorithm design,Decentralised system,Linear system,Computer science,Shapley value,Network topology,Game theory,Bondareva–Shapley theorem,Distributed computing
Conference
ISSN
Citations 
PageRank 
2325-369X
0
0.34
References 
Authors
5
5
Name
Order
Citations
PageRank
Muros, F.J.1113.70
Jose Maria Maestre23214.98
Encarnación Algaba Durán3799.14
Alamo Teodoro430736.82
e f camacho572.02