Limiting Dynamics for Q-Learning with Memory One in Symmetric Two-Player, Two-Action Games

Table 3

All strategy pairs solving the Bellman equations self-consistently for the stag hunt game, their structural and behavioural types, the conditions for their existence, and the regions of Figure 4 in which they exist.

Policy-pair	Type	Conditions	Regions
	Sym, NCC	Always
	Sym, NCC	Always
	Sym, CC	Always
	Sym, CC	Always
	Sym, CC	Always
	Sym, CC
	Sym, CC
	Sym, NCC
	CM, CC	Always
	CM, CC	Always
	CM, CC
	CM, CC
	CM, NCC
	CM, NCC
	CM, CC
	CM, CC