Abstract
In this paper, the game theory solution concept known as Banzhaf value is applied to games in coalitional control schemes. In these schemes, the network topology is modified to achieve a trade-off between performance and communication burden. In particular, we show how to design a coalitional scheme with constraints regarding the Banzhaf value. Several similarities and differences of this value with respect to the Shapley value are stated, and the concept of amalgamated game is introduced in coalitional control as a means to relieve the computational burden. Finally, an academic simulation example illustrates the results obtained in this work.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
