#3310. Inverse Preference Optimization in the Graph Model for Conflict Resolution based on the Genetic Algorithm

September 2026publication date
Proposal available till 17-06-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Social Sciences (all);
Arts and Humanities (miscellaneous);
Strategy and Management;
Management of Technology and Innovation;
Decision Sciences (all);
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №3310.1 Contract №3310.2 Contract №3310.3 Contract №3310.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
The Inverse GMCR (Graph Model for Conflict Resolution) produces rankings of possible states that will make the desired resolution of a conflict stable. There are usually numerous preference relation profiles making it difficult for a third party to choose an appropriate preference relation to design its mediation strategy. The current research presents two inverse preference optimization models considering the cost and effort in changing preferences to address these issues. The first model aims to ascertain an optimal preference at minimum adjustment cost such that the desired equilibrium is reached. The other model is to find an optimal required preference under minimum adjustment amount, which is defined as the difference between the required preference matrix and the original preference matrix.
Keywords:
Conflict Resolution; Genetic Algorithm; Graph Model for Conflict Resolution; Group decision and negotiation; Preference optimization

Contacts :
0