The graph model for conflicts (Q1086182)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3982958
Language Label Description Also known as
default for all languages
No label defined
    English
    The graph model for conflicts
    scientific article; zbMATH DE number 3982958

      Statements

      The graph model for conflicts (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      1987
      0 references
      The graph model for conflicts is developed as a comprehensive methodology for realistically analyzing real world conflicts. The graph form takes outcomes, rather than individual decisions, as the basic units for describing a conflict. In the graph form, many solution concepts can be formulated for both two-player and multiplayer games. In particular, specific mathematical criteria are presented for categorizing solution concepts which can be used for predicting equilibria in n-player games. One of the criteria on which this taxonomy of solution concepts is based is the number of steps ahead a player may think, in terms of the reactions of other players to his actions. Other criteria include which players take part in the sanctioning process, and whether sanctioning moves are restricted to those which lead to immediate improvements for the mover. In order to demonstrate the insight which decision makers can gain from studying a dispute using the graph model, various solution concepts are applied to an important environmental engineering problem.
      0 references
      system analysis
      0 references
      large-scale systems
      0 references
      water resources
      0 references
      graph model for conflicts
      0 references
      world conflicts
      0 references
      two-player and multiplayer games
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers