IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v321y2025i2p543-564.html
   My bibliography  Save this article

Exploring the minimum cost conflict mediation path to a desired resolution within the inverse graph model framework

Author

Listed:
  • Zhu, Yan
  • Dong, Yucheng
  • Zhang, Hengjie
  • Fang, Liping

Abstract

The existing inverse graph model for conflict resolution (GMCR) research primarily concentrates on identifying the required preferences of decisions makers (DMs) such that a desired state is an equilibrium. However, the process of transitioning from the current state to the desired equilibrium is not explored. In this paper, we propose a minimum adjustment cost model taking account of preference adjustment costs to identify the required preferences for a desired state to be an equilibrium. Subsequently, we introduce the concept of transition costs for the first time to quantify expenses involved in guiding a DM transition from one state to another and develop a minimum cost conflict mediation path model. This model aims to identify the most efficient path that minimizes the cost of transitioning from the current state to the desired equilibrium. Moreover, to accommodate the consideration of multiple desired equilibria, we extend the minimum cost conflict mediation path model to analyze and determine the optimal path for transitioning from the current state to one of the identified desired equilibria with the overall minimum cost. Furthermore, to address uncertainty surrounding transition costs, we formulate a probability maximizing conflict mediation path model that considers a limited budget available for the mediation process. Finally, a real-world dispute, the fracking conflict in the province of New Brunswick, Canada, is utilized to demonstrate the application of the proposed models.

Suggested Citation

  • Zhu, Yan & Dong, Yucheng & Zhang, Hengjie & Fang, Liping, 2025. "Exploring the minimum cost conflict mediation path to a desired resolution within the inverse graph model framework," European Journal of Operational Research, Elsevier, vol. 321(2), pages 543-564.
  • Handle: RePEc:eee:ejores:v:321:y:2025:i:2:p:543-564
    DOI: 10.1016/j.ejor.2024.10.014
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2024.10.014?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:ejores:v:321:y:2025:i:2:p:543-564. 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: http://www.elsevier.com/locate/eor .

    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.