Theory and application of conflict resolution with hybrid preference in colored graphs
From MaRDI portal
Publication:350409
DOI10.1016/J.APM.2012.03.009zbMATH Open1351.05092OpenAlexW2066370008MaRDI QIDQ350409FDOQ350409
Authors: D. Marc Kilgour, Edward A. McBean, Haiyan 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
Recommendations
- Graph model for conflict resolution with consistent preference and its application
- Conflict-free colourings of graphs and hypergraphs
- Conflict-free colouring of graphs
- Conflict-free coloring and its applications
- Conflict-free coloring of graphs
- Upper and lower probabilistic preferences in the graph model for conflict resolution
- Optimizing the cost of preference manipulation in the graph model for conflict resolution
- Publication:3199158
- Complexity of conflict-free colorings of graphs
- On variants of conflict-free-coloring for hypergraphs
Cites Work
- Non-cooperative games
- Equilibrium points in n -person games
- Title not available (Why is that?)
- Strength of preference in graph models for multiple-decision-maker conflicts
- The edge versus path incidence matrix of series-parallel graphs and greedy packing
- 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
Cited In (4)
This page was built for publication: Theory and application of conflict resolution with hybrid preference in colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350409)
