1. ¹Odette School of Business, University of Windsor, Windsor, Ontario, Canada
2. ²Department of Mathematics, Wilfrid Laurier University, Waterloo, Ontario, Canada
3. ³Department of Systems Design Engineering, University of Waterloo, Waterloo, Ontario, Canada

Correspondence: KW Hipel, Department of Systems Design Engineering, University of Waterloo, Waterloo, ON, Canada N2L 3G1. E-mail: kwhipel@uwaterloo.ca

Received 0 November 2003; Accepted 0 July 2004; Published online 24 November 2004.

Abstract

The graph model for conflict resolution, an analysis paradigm for strategic conflicts, has mainly relied on stability analysis for its conclusions. This paper proposes algorithms to apply another analysis technique, status quo analysis, to a graph model. Status quo analysis is dynamic and forward-looking, in contrast to Stability Analysis, which is static and contingent. Status quo analysis is carried out by means of a directed graph that tracks moves and countermoves from a status quo state, and a table that records the reachability status of states from the status quo. Different algorithms are proposed to produce status quo diagrams with and without restrictions on moves; more efficient versions of the algorithm for the case of transitive graphs are also put forward. Properties of diagrams generated by different algorithms are investigated. A case study illustrates how status quo analysis can be applied, and how it interacts with other analysis methodologies.