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

DOI10.1016/j.ejor.2010.03.025zbMath1205.05233OpenAlexW1987798963MaRDI QIDQ992610

Graeme Kemkes, D. Marc Kilgour, Keith William Hipel, Hai-Yan Xu

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

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

Related Items (16)

A hierarchical graph model for conflict resolution with sequential moves ⋮ Theory and application of conflict resolution with hybrid preference in colored graphs ⋮ Alternating-pancyclism in 2-edge-colored graphs ⋮ Matrix representation and extension of coalition analysis in group decision support ⋮ A generalization of properly colored paths and cycles in edge-colored graphs ⋮ A Basic Hierarchical Graph Model for Conflict Resolution with Application to Water Diversion Conflicts in China ⋮ 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 ⋮ The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles ⋮ Matrix representations of the inverse problem in the graph model for conflict resolution ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ Theory and implementation of coalitional analysis in cooperative decision making ⋮ Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs ⋮ Some conditions for the existence of Euler \(H\)-trails ⋮ Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm ⋮ \(H\)-cycles in \(H\)-colored multigraphs

Cites Work

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

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