IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2011.02739.html
   My bibliography  Save this paper

Asymmetric games on networks: towards an Ising-model representation

Author

Listed:
  • A. D. Correia
  • L. L. Leestmaker
  • H. T. C. Stoof

Abstract

We here study the Battle of the Sexes game, a textbook case of asymmetric games, on small networks. Due to the conflicting preferences of the players, analytical approaches are scarce and most often update strategies are employed in numerical simulations of repeated games on networks until convergence is reached. As a result, correlations between the choices of the players emerge. Our approach is to study these correlations with a generalized Ising model. Using the response strategy framework, we describe how the actions of the players can bring the network into a steady configuration, starting from an out-of-equilibrium one. We obtain these configurations using game-theoretical tools, and describe the results using Ising parameters. We exhaust the two-player case, giving a detailed account of all the equilibrium possibilities. Going to three players, we generalize the Ising model and compare the equilibrium solutions of three representative types of network. We find that players that are not directly linked retain a degree of correlation that is proportional to their initial correlation. We also find that the local network structure is the most relevant for small values of the magnetic field and the interaction strength of the Ising model. Finally, we conclude that certain parameters of the equilibrium states are network independent, which opens up the possibility of an analytical description of asymmetric games played on networks.

Suggested Citation

  • A. D. Correia & L. L. Leestmaker & H. T. C. Stoof, 2020. "Asymmetric games on networks: towards an Ising-model representation," Papers 2011.02739, arXiv.org, revised Aug 2021.
  • Handle: RePEc:arx:papers:2011.02739
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2011.02739
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2011.02739. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.