LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

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

Photo by garri from unsplash

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,… Click to show full 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.

Keywords: decision; resolution; solving inverse; graph model; integer programming

Journal Title: Group Decision and Negotiation
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.