Abstract
This paper studies the strategy consensus for a class of random evolutionary games, that is, random evolutionary Boolean games (REBG), by using the semi-tensor product of matrices. The RBEG is converted into an algebraic form, based on which, a necessary and sufficient condition is presented to check the strategy consensus for REBG. A numerical example is worked out to illustrate the efficiency of the obtained results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: DEStech Transactions on Engineering and Technology Research
Disclaimer: 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.