Abstract
We propose a new approach to investigating such non-cooperative games, as tournaments and evolutionary games. Our model of symmetric game is based on partition classes of integers, and the rules are similar to those of well-known Colonel Lotto game. We present detailed model of dynamics of evolutionary game with two populations of matrix strategies. A win (according to Lotto game’s rules) leads to precise replication of the winning strategy, a loss leads to eliminating the losing strategy. We specify efficiently computable properties of partitions allowing to classify the set of partitions according to their winning ability and present detailed simulation results for the evolutionary Lotto game with (100,10)-partitions. The results of the simulations fully support the classification principles we are proposing.
Sign-in/Register to access full text options 
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 callMore From: International Review on Modelling and Simulations (IREMOS)
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.
