We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
An Integer Programming Approach to Solving the Inverse Graph Model for Conflict Resolution with Two Decision Makers.
- Authors
Han, Yu; Xu, Haiyan; Fang, Liping; Hipel, Keith W.
- Abstract
Operational algorithms for solving the inverse problem for the graph model for conflict resolution are presented for the case of two decision makers (DMs) under a variety of solution concepts, including Nash stability (Nash), general metarationality (GMR), symmetric metarationality (SMR), and sequential stability (SEQ). The algorithms based on integer programming enable a DM, an analyst, or a mediator to obtain all of the preferences required to make a specified state to be an equilibrium or resolution. For the cases of Nash, GMR, and SMR, the respective inverse algorithm for the focal DM is formulated as a 0–1 integer linear programming problem even when both DMs' preferences are unknown. For the situation of SEQ, when both DMs' preferences are unknown, the focal DM's algorithm is a 0–1 integer nonlinear programming problem while, under the condition that the opponent's preferences are known, the focal DM's 0–1 integer programming problem is linear. The usefulness of the algorithms developed is demonstrated by applying them to an illustrative dispute.
- Subjects
INTEGER programming; CONFLICT management; LINEAR programming; NONLINEAR programming; INVERSE problems
- Publication
Group Decision & Negotiation, 2022, Vol 31, Issue 1, p23
- ISSN
0926-2644
- Publication type
Article
- DOI
10.1007/s10726-021-09755-w