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)
Minimum rank of a graph Minimum rank of a graph In mathematics, the minimum rank is a graph parameter formula_1 for any graph "G". It was motivated by the Colin de Verdière's invariant. The adjacency matrix of a given undirected graph is a symmetric matrix whose rows and columns both correspond to the vertices of the graph. Its coefficients are all 0 or 1, and the coefficient in row "i" and column "j" is nonzero whenever vertex "i" is adjacent to vertex "j" in the graph. More generally, one can define a "generalized adjacency matrix" to be any matrix of real numbers with the same