IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v501y2025ics0096300325001961.html
   My bibliography  Save this article

Group size dynamics for a group following game with shared rewards

Author

Listed:
  • Wettergren, Thomas A.

Abstract

We consider a population game in which a group of mobile individuals must repeatedly decide between two strategies: following other neighbors or moving on their own. When following others there is an improvement due to directed motion but a sharing of the credit for any rewards obtained. Conversely, the individual strategy provides for a full share of the credit for any rewards obtained at the cost of less-directed motion. This process leads to a dilemma with dynamically adjusting strategies and a resulting dynamic change in the number of group followers. The process is modeled as an evolutionary game with simple parameters that describe the differences in the motion opportunities and the sharing of rewards. A detailed analysis of the dynamics of the game is presented to show how the parameters affect the resulting equilibria solutions. Numerical methods are used to validate the analysis conclusions and simulations are performed to validate the analytical model of the evolutionary game.

Suggested Citation

  • Wettergren, Thomas A., 2025. "Group size dynamics for a group following game with shared rewards," Applied Mathematics and Computation, Elsevier, vol. 501(C).
    • Handle: RePEc:eee:apmaco:v:501:y:2025:i:c:s0096300325001961
    DOI: 10.1016/j.amc.2025.129470
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325001961
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129470?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search 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:eee:apmaco:v:501:y:2025:i:c:s0096300325001961. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.