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

Exploring multi-potential games in strategic form: A graph theoretic approach

Author

Listed:
  • Liu, Aixin
  • Li, Haitao
  • Wang, Lin

Abstract

Multi-potential games (MPGs), wherein the facility cost functions of players are distinct, significantly expand the scope of traditional potential games. This paper explores the payoff-related structure properties within MPGs, with a focus on the categorization of players according to their conflicting interests. Initially, the study establishes a necessary and sufficient condition to determine if a finite non-cooperative game qualifies as a potential game. Subsequently, it demonstrates that players with conflicting interests cannot share the same potential function. Leveraging the principles of graph theory in alignment with players' conflicting interests, the study identifies the minimal potential index in MPGs, which provides the construction of all possible player partitions. Finally, the study examines a network game affected by external payoff matrix perturbations. It demonstrates how MPGs can effectively illuminate the intricate connection of common and conflicting interests among players.

Suggested Citation

  • Liu, Aixin & Li, Haitao & Wang, Lin, 2024. "Exploring multi-potential games in strategic form: A graph theoretic approach," Applied Mathematics and Computation, Elsevier, vol. 474(C).
    • Handle: RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001486
    DOI: 10.1016/j.amc.2024.128676
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324001486
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128676?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:474:y:2024:i:c:s0096300324001486. 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.