Chicken payoff ordering 2026-10-25
The Chicken payoff ordering describes a symmetric two-player bimatrix game in which aggression earns temptation against yielding, mutual yielding earns , yielding to aggression earns , and mutual aggression earns , with the displayed strict ordering. Aggression is a best response to yielding, and yielding is a best response to aggression. Thus the two asymmetric action pairs are pure strategy Nash equilibria. The Hawk-Dove game has this ordering in its positive-resource regime where the damage cost exceeds the resource value. In the prisoner's dilemma, the ordering of and is reversed, making defection a strictly dominant strategy instead.
Reading the lower-left number in each source cell as player 1's payoff, against an opponent playing the player's own payoffs from are ; against they are . For , identify with aggressive defection and with yielding cooperation. The standard payoffs then have valuesThe prisoner's dilemma ordering holds precisely for and with this labeling. For example, gives . Each player then has the strictly dominant strategy , although gives both a larger payoff than . Here as well, so the optional weak aggregate-payoff condition is met with equality.
For the Chicken payoff ordering, the collision outcome must be worse than yielding to an aggressive opponent: . This holds for and , for example . Against , the best response is because ; against , it is because . Consequently and are the two pure strategy Nash equilibria, and mutual aggression is the worst outcome for both.
If action names may be exchanged, there is another prisoner's dilemma region: take as cooperation and as defection. Then , so and also work, for example . This relabeling explains why the first displayed region is not a necessary condition without an action convention. Equality at any of these boundaries destroys the strict ordering.