loading page

Prescribed Time Convergence for Continuous Action Iterative Dilemma with Lyapunov Analysis
  • +1
  • Syed Muhammad Amrr,
  • Mohamed Zaery,
  • S M Suhail Hussain,
  • Mohammad A Abido
Syed Muhammad Amrr

Corresponding Author:[email protected]

Author Profile
Mohamed Zaery
S M Suhail Hussain
Mohammad A Abido


This paper proposes a new approach for convergence analysis of continuous action iterative dilemma (CAID) to reach a stable consensus outcome within the prescribed time. Unlike usual game theory, where players can only choose between two options, i.e., cooperation or defection, CAID lets players pick from varying options and make more nuanced decisions. In the proposed strategy, a prescribed function, which is tunable by the user, adapts the learning rate of the player's strategy. This new method guarantees that players will eventually agree on a single strategy, regardless of where they started initially, and it achieves this agreement in a predefined time set by the user. The Lyapunov analysis guarantees the convergence of strategy to a consensus within a prescribed time. The simulation results of the proposed scheme with two evolutionary game examples demonstrate faster convergence and fewer iterations compared to the state-of-the-art method.
22 Apr 2024Submitted to TechRxiv
29 Apr 2024Published in TechRxiv