In this paper, an N-coalitions game of multi-agents system is investigated, which is a combination problem of distributed optimization and game. The objective functions of the coalition depend on not only its members’ decisions, but also the decisions of other coalitions. A algorithm is designed for the agent to seek the Nash equilibrium of the N-coalitions games. By constructing suitable a Lyapunov function, we analyze the convergence of the algorithm, which indicates that algorithm can achieve exponential convergence. Finally, a numerical example is given to illustrate the effectiveness of the methods.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An Algorithm Design for N-coalitions Games


    Weitere Titelangaben:

    Lect. Notes Electrical Eng.


    Beteiligte:
    Wu, Meiping (Herausgeber:in) / Niu, Yifeng (Herausgeber:in) / Gu, Mancang (Herausgeber:in) / Cheng, Jin (Herausgeber:in) / He, Bing (Autor:in) / Zheng, Zhiyuan (Autor:in) / Zhou, Jian (Autor:in) / Li, Sining (Autor:in) / Du, Jiangtao (Autor:in)

    Kongress:

    International Conference on Autonomous Unmanned Systems ; 2021 ; Changsha, China September 24, 2021 - September 26, 2021



    Erscheinungsdatum :

    2022-03-18


    Format / Umfang :

    7 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Coalitions for distributed sensor fusion

    Howard, M. / Payton, D. / Estkowski, R. | IEEE | 2002


    Coalitions for Distributed Sensor Fusion

    Howard, M. / Payton, D. / Estowski, R. et al. | British Library Conference Proceedings | 2002


    The nucleolus and the essential coalitions

    Huberman, Gur | Springer Verlag | 1980



    fire fighting drones capable of identifying the coalitions

    KANG IL YONG | Europäisches Patentamt | 2022

    Freier Zugriff