Fixed time convergence approach for multiplayer iterated dilemmas with continuous action
This paper introduces a novel fixed-time scheme for analyzing the convergence of the multiplayer continuous action-iterated dilemma (CAID). In contrast to conventional evolutionary game theory, which restricts players to binary strategies of cooperation or defection, CAID allows for continuous strat...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-12-01
|
| Series: | Results in Engineering |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2590123024013926 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846115840919863296 |
|---|---|
| author | Syed Muhammad Amrr Mohamed Zaery S.M. Suhail Hussain Mohammad A. Abido |
| author_facet | Syed Muhammad Amrr Mohamed Zaery S.M. Suhail Hussain Mohammad A. Abido |
| author_sort | Syed Muhammad Amrr |
| collection | DOAJ |
| description | This paper introduces a novel fixed-time scheme for analyzing the convergence of the multiplayer continuous action-iterated dilemma (CAID). In contrast to conventional evolutionary game theory, which restricts players to binary strategies of cooperation or defection, CAID allows for continuous strategies and offers players a spectrum of choices. Additionally, two discount rates are incorporated in the strategy dynamics to reflect the imprecision in players' learning from strategic differences. The proposed algorithm ensures a fixed-time convergence of consensus between the player strategies. As a result, the settling time of consensus is independent of the initial strategy. Lyapunov stability theory is employed to assess convergence within a fixed time. Moreover, simulation results demonstrate the superiority of the proposed algorithm, converging more quickly and with fewer iterations than the recently established results. |
| format | Article |
| id | doaj-art-c8ce16cac12a4da8a534b062eda1197c |
| institution | Kabale University |
| issn | 2590-1230 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Results in Engineering |
| spelling | doaj-art-c8ce16cac12a4da8a534b062eda1197c2024-12-19T10:58:18ZengElsevierResults in Engineering2590-12302024-12-0124103137Fixed time convergence approach for multiplayer iterated dilemmas with continuous actionSyed Muhammad Amrr0Mohamed Zaery1S.M. Suhail Hussain2Mohammad A. Abido3Control and Instrumentation Engineering Department, King Fahd University of Petroleum & Minerals (KFUPM), Dhahran, Saudi Arabia; Interdisciplinary Research Center for Sustainable Energy Systems (IRC-SES), KFUPM, Dhahran, Saudi Arabia; Corresponding author at: Control & Instrumentation Engineering Department, King Fahd University of Petroleum & Minerals (KFUPM), Dhahran, Saudi Arabia.K. A. CARE Energy Research & Innovation Center, KFUPM, Saudi ArabiaInterdisciplinary Research Center for Sustainable Energy Systems (IRC-SES), KFUPM, Dhahran, Saudi Arabia; Electrical Engineering Department, KFUPM, Dhahran, Saudi ArabiaInterdisciplinary Research Center for Sustainable Energy Systems (IRC-SES), KFUPM, Dhahran, Saudi Arabia; Electrical Engineering Department, KFUPM, Dhahran, Saudi Arabia; SDAIA-KFUPM Joint Research Center for Artificial Intelligence, KFUPM, Dhahran, Saudi ArabiaThis paper introduces a novel fixed-time scheme for analyzing the convergence of the multiplayer continuous action-iterated dilemma (CAID). In contrast to conventional evolutionary game theory, which restricts players to binary strategies of cooperation or defection, CAID allows for continuous strategies and offers players a spectrum of choices. Additionally, two discount rates are incorporated in the strategy dynamics to reflect the imprecision in players' learning from strategic differences. The proposed algorithm ensures a fixed-time convergence of consensus between the player strategies. As a result, the settling time of consensus is independent of the initial strategy. Lyapunov stability theory is employed to assess convergence within a fixed time. Moreover, simulation results demonstrate the superiority of the proposed algorithm, converging more quickly and with fewer iterations than the recently established results.http://www.sciencedirect.com/science/article/pii/S2590123024013926Evolutionary game theoryPrisoner's dilemmaMulti-agent systemFixed time stabilityLyapunov theory |
| spellingShingle | Syed Muhammad Amrr Mohamed Zaery S.M. Suhail Hussain Mohammad A. Abido Fixed time convergence approach for multiplayer iterated dilemmas with continuous action Results in Engineering Evolutionary game theory Prisoner's dilemma Multi-agent system Fixed time stability Lyapunov theory |
| title | Fixed time convergence approach for multiplayer iterated dilemmas with continuous action |
| title_full | Fixed time convergence approach for multiplayer iterated dilemmas with continuous action |
| title_fullStr | Fixed time convergence approach for multiplayer iterated dilemmas with continuous action |
| title_full_unstemmed | Fixed time convergence approach for multiplayer iterated dilemmas with continuous action |
| title_short | Fixed time convergence approach for multiplayer iterated dilemmas with continuous action |
| title_sort | fixed time convergence approach for multiplayer iterated dilemmas with continuous action |
| topic | Evolutionary game theory Prisoner's dilemma Multi-agent system Fixed time stability Lyapunov theory |
| url | http://www.sciencedirect.com/science/article/pii/S2590123024013926 |
| work_keys_str_mv | AT syedmuhammadamrr fixedtimeconvergenceapproachformultiplayeriterateddilemmaswithcontinuousaction AT mohamedzaery fixedtimeconvergenceapproachformultiplayeriterateddilemmaswithcontinuousaction AT smsuhailhussain fixedtimeconvergenceapproachformultiplayeriterateddilemmaswithcontinuousaction AT mohammadaabido fixedtimeconvergenceapproachformultiplayeriterateddilemmaswithcontinuousaction |