Abstract

The Prisoner’s Dilemma, a representative example of game theory, is a classic game in which two players receive rewards based on two action strategies(cooperation or defection). However, many variations have been made depending onchanges in conditions(number of participants, behavioral strategies, reward values, number of games, etc.). In this study, an extended Prisoner’s Dilemma game was used in which a genetic algorithm was applied to the iterative Prisoner’sDilemma game to improve the selection probability function to determine which action strategy should be selected according to changes in reward value. A possible SPS(selection probability strategy) was developed. As a result of theprogram simulation, this SPS ranked high in the early stages, showed good performance, and was generally a dominant strategy that survived until the final stage. This study is significant in that it suggests the possibility of developing a new strategy in the Prisoner’s Dilemma game and reaffirms existing strategies that are generally effective.

Full Text
Paper version not known

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 call

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.