An Integer Programming Approach to Solving the Inverse Graph Model for Conflict Resolution with Two Decision Makers

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 sequen...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Group decision and negotiation Ročník 31; číslo 1; s. 23 - 48
Hlavní autori: Han, Yu, Xu, Haiyan, Fang, Liping, Hipel, Keith W.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Netherlands 01.02.2022
Springer Nature B.V
Predmet:
Algorithms
Biological and Physical Anthropology
Business and Management
Conflict resolution
Decision makers
Decision making
Integer programming
Linear programming
Nonlinear programming
Usefulness
Integer programming
Inverse analysis
Stability definitions
Matrix representation
Graph model for conflict resolution
Unknown preference
ISSN:0926-2644, 1572-9907
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0926-2644
1572-9907
DOI:10.1007/s10726-021-09755-w