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)
Shannon capacity of a graph Shannon capacity of a graph In graph theory, the Shannon capacity of a graph is a graph invariant defined from the number of independent sets of strong graph products. It measures the Shannon capacity of a communications channel defined from the graph, and is upper bounded by the Lovász number, which can be computed in polynomial time. However, the computational complexity of the Shannon capacity itself remains unknown. The Shannon capacity models the amount of information that can be transmitted across a noisy communication channel in which certain signal values can be confused with each other. In this application, the