Author
Listed:
- Hasan Haq
(City St George’s, University of London)
- Pedro H. T. Schimit
(Universidade Nove de Julho)
- Mark Broom
(City St George’s, University of London)
Abstract
In recent years, classical evolutionary models have been extended to incorporate realistic multiplayer interactions rather than the traditional pairwise modelling approach. Several papers have introduced a new evolutionary framework involving population structure, evolutionary dynamics, multiplayer games and movement processes. The theory underlying the framework has been explored in several directions, identifying strong predictors of fixation probability, such as mean group size and temperature. A recent study developed an evolutionary model where individuals move in a coordinated manner via newly developed movement mechanisms, resulting in herding or separation within the population. This analysis demonstrated that these movement mechanisms impact the fixation probability of cooperation. This paper extends this analysis by investigating whether the previously identified predictors of fixation probability retain their strong influences under different games on complete graphs and by considering a different social dilemma in the form of the Stag-Hunt game. We show that previously defined measures of aggregation are directly related to mean group size and that these fundamental measures can be analytically calculated. In the Stag-Hunt game, we demonstrate that herding opposes the evolution of cooperation. In the Public Goods game, we demonstrate that temperature and fixation share a linear relationship regardless of the movement mechanism considered. In the Hawk-Dove game, temperature is a stronger predictor of fixation but the linear relationship breaks down for higher temperatures and a similar relationship holds as for the Stag-Hunt game.
Suggested Citation
Hasan Haq & Pedro H. T. Schimit & Mark Broom, 2025.
"Predictors of Fixation Probability on Complete Networks Involving Multiplayer Interactions Under Coordinated Movement Systems,"
Dynamic Games and Applications, Springer, vol. 15(4), pages 1294-1316, September.
Handle:
RePEc:spr:dyngam:v:15:y:2025:i:4:d:10.1007_s13235-025-00635-5
DOI: 10.1007/s13235-025-00635-5
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:dyngam:v:15:y:2025:i:4:d:10.1007_s13235-025-00635-5. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.