Theory and application of conflict resolution with hybrid preference in colored graphs

DOI10.1016/j.apm.2012.03.009zbMath1351.05092OpenAlexW2066370008MaRDI QIDQ350409

Edward A. McBean, D. Marc Kilgour, Hai-Yan Xu, Keith William Hipel

Publication date: 7 December 2016

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2012.03.009

zbMATH Keywords

matrix representationconflict resolutiondecision makergraph modelhybrid preference

Mathematics Subject Classification ID

Decision theory (91B06) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Theory and implementation of coalitional analysis in cooperative decision making

Cites Work

• Unnamed Item
• Combining strength and uncertainty for preferences in the graph model for conflict resolution with multiple decision makers
• An integrated algebraic approach to conflict resolution with three-level preference
• Using matrices to link conflict evolution and resolution in a graph model
• Strength of preference in graph models for multiple-decision-maker conflicts
• Non-cooperative games
• Equilibrium points in n -person games
• The edge versus path incidence matrix of series-parallel graphs and greedy packing

This page was built for publication: Theory and application of conflict resolution with hybrid preference in colored graphs