Using matrices to link conflict evolution and resolution in a graph model

The graph model for conflict resolution provides a convenient and effective means to model and analyze a strategic conflict. Standard practice is to carry out a stability analysis of a graph model, and then to follow up with a post-stability analysis, an important component of which is status quo analysis. A graph model can be viewed as an edge-colored graph, but the fundamental problem of status quo analysis - to find a shortest colored path from the status quo node to a desired equilibrium - is different from the well-known network analysis problem of finding the shortest path between two nodes. The only matrix method that has been proposed cannot track all aspects of the evolution of a conflict from the status quo state. Our explicit algebraic approach is convenient for computer implementation and, as demonstrated with a real world case study, easy to use. It provides new insights into a graph model, not only identifying all equilibria reachable from the status quo, but also how to reach them. Moreover, this approach bridges the gap between stability analysis and status quo analysis in the graph model for conflict resolution.