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

DOI10.1016/J.EJOR.2010.03.025MaRDI QIDQ992610zbMATH OpenOpenAlexFDO

Authors D. Marc Kilgour, Graeme Kemkes, Haiyan Xu, Keith William Hipel

Publication date 9 September 2010

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2010.03.025

zbMATH Keywords

incidence matrixgraph model for conflict resolutionstatus quo analysiscolored pathunilateral improvement arc-incidence matrixunilateral move arc-incidence matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Recommendations

• A matrix approach to status quo analysis in the graph model for conflict resolution
• Status quo analysis in the graph model for conflict resolution
• Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences
• Matrix representation of consensus and dissent stabilities in the graph model for conflict resolution
• Choice stabilities in the graph model for conflict resolution

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 4033548 (Why is no real title available?)
• scientific article; zbMATH DE number 5240213 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A Search Procedure for Hamilton Paths and Circuits
• A matrix approach to status quo analysis in the graph model for conflict resolution
• A matrix-based approach to searching colored paths in a weighted colored multidigraph
• A note on two problems in connexion with graphs
• An extension of labeling techniques for finding shortest path trees
• Backtrack Programming
• Colouring paths in directed symmetric trees with applications to WDM routing
• Conflict models in graph form: Solution concepts and their interrelationships
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Handbook of group decision and negotiation
• Paths and trails in edge-colored graphs
• Status quo analysis in the graph model for conflict resolution
• The graph model for conflicts
• The interactive analysis of the multicriteria shortest path problem by the reference point method.

Cited in

(28)

• A hierarchical graph model for conflict resolution with sequential moves
• A Basic Hierarchical Graph Model for Conflict Resolution with Application to Water Diversion Conflicts in China
• Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences
• A generalization of properly colored paths and cycles in edge-colored graphs
• \(H\)-cycles in \(H\)-colored multigraphs
• Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
• Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
• A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
• A matrix-based approach to searching colored paths in a weighted colored multidigraph
• Matrix representation and extension of coalition analysis in group decision support
• Theory and application of conflict resolution with hybrid preference in colored graphs
• State transition time analysis in the graph model for conflict resolution
• Alternating-pancyclism in 2-edge-colored graphs
• Status quo analysis in the graph model for conflict resolution
• Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm
• A matrix approach to status quo analysis in the graph model for conflict resolution
• Matrix representations of Berge stabilities in the graph model for conflict resolution
• The graph model for conflicts
• The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
• On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
• Matrix representation of consensus and dissent stabilities in the graph model for conflict resolution
• Mixed stabilities for analyzing opponents' heterogeneous behavior within the graph model for conflict resolution
• State transition for de-escalation in the graph model for conflict resolution framework
• Some conditions for the existence of Euler \(H\)-trails
• Conflict models in graph form: Solution concepts and their interrelationships
• Theory and implementation of coalitional analysis in cooperative decision making
• Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
• Matrix representations of the inverse problem in the graph model for conflict resolution

This page was built for publication: Using matrices to link conflict evolution and resolution in a graph model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992610)