Theory and application of conflict resolution with hybrid preference in colored graphs
From MaRDI portal
(Redirected from Publication:350409)
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
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- An integrated algebraic approach to conflict resolution with three-level preference
- Combining strength and uncertainty for preferences in the graph model for conflict resolution with multiple decision makers
- Equilibrium points in n -person games
- Non-cooperative games
- Strength of preference in graph models for multiple-decision-maker conflicts
- The edge versus path incidence matrix of series-parallel graphs and greedy packing
- Using matrices to link conflict evolution and resolution in a graph model
Cited in
(4)- scientific article; zbMATH DE number 6613348 (Why is no real title available?)
- A matrix-based approach to searching colored paths in a weighted colored multidigraph
- An integrated algebraic approach to conflict resolution with three-level preference
- Theory and implementation of coalitional analysis in cooperative decision making
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)