IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v511y2026ics0096300325004485.html

Equilibrium analysis of edge-heterogeneous binary network games

Author

Listed:
  • Wang, Jiawen
  • Luan, Yangyang
  • Wu, Xiaoqun

Abstract

Recent studies on the equilibrium of binary network games have primarily focused on scenarios characterized by agent heterogeneity, where agents exhibit unique attributes but their interactions with different neighbors remain uniform. In this paper, we investigate the edge-heterogeneous binary network game, a more general framework that incorporates heterogeneity into agent interactions. We establish two sufficient equilibrium conditions under asynchronous best-response dynamics from different perspectives. The first condition requires underlying symmetry in interactions between neighboring agents, integrating and generalizing three classical convergence situations in binary network games. The second condition focuses on network balance, positing that equilibrium is achievable if the coordination value network of a game is structurally balanced. Additionally, for games meeting this condition, we develop a method to predict the final state based on initial state information. These results reveal factors that steer edge-heterogeneous binary network games towards equilibrium, providing valuable insights for controlling such highly nonlinear systems. Lastly, we extend the analysis to higher-order network games and propose an equilibrium condition for edge-heterogeneous 2-order network games.

Suggested Citation

  • Wang, Jiawen & Luan, Yangyang & Wu, Xiaoqun, 2026. "Equilibrium analysis of edge-heterogeneous binary network games," Applied Mathematics and Computation, Elsevier, vol. 511(C).
  • Handle: RePEc:eee:apmaco:v:511:y:2026:i:c:s0096300325004485
    DOI: 10.1016/j.amc.2025.129723
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325004485
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2025.129723?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:apmaco:v:511:y:2026:i:c:s0096300325004485. 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.