Chicken (game) respectively. The line in graph on the left shows the optimum probability of playing the escalated strategy for player Y as a function of "x". The line in the second graph shows the optimum probability of playing the escalated strategy for player X as a function of "y" (the axes have not been rotated, so the dependent variable is plotted on the abscissa, and the independent variable is plotted on the ordinate). The Nash equilibria are where the players' correspondences agree, i.e., cross. These are shown with points in the right hand graph. The best response mappings agree (i.e., cross)
Strength of a graph algorithm was discovered by Cunningham (1985). The algorithm with best complexity for computing exactly the strength is due to Trubin (1993), uses the flow decomposition of Goldberg and Rao (1998), in time formula_10. Strength of a graph In the branch of mathematics called graph theory, the strength of an undirected graph corresponds to the minimum ratio "edges removed"/"components created" in a decomposition of the graph in question. It is a method to compute partitions of the set of vertices and detect zones of high concentration of edges, and is analogous to graph toughness which is defined similarly for vertex removal.