Society · Coordination
GameTransitionGraph#981d
A graph of pure coordination games whose edges are weighted by how many agents must switch strategy
Mechanism
For a fixed set of agents, each node is a pure coordination game: one payoff matrix, shared by all agents. As conditions change, the game being played moves along edges. Weight each edge by its laterality, the number of agents whose best strategy differs between the two games, so each edge is a transition as in OrganisationGame, priced as in LateralityCost. Given a forecast mix of likely games, a strategic position is the strategy profile that minimises expected laterality over likely transitions, even at some loss in the current game. That loss is the cost of holding the position. Like AgentTransitionGraph, it can be read backwards from a target game, but it weights edges by coordination effort, not by observed probability.
Invariants
- Every node is a pure coordination game, so agents never disagree about payoffs
- For n agents, edge weights range from 0 to n
Failure modes
- Modelling only the current game and missing the cost of the next transition
- Ignoring the price of a strategic position in the current game
Where this came from
Builds on
Identity
The name is the hash of the definition. Change a word and it becomes a different pattern.
- Sema ID
sema:GameTransitionGraph#mh:SHA-256:981d21c98c94ba0a90c39f06c9f1768832d512ae27a6cbd750837bcda461be00- Reference
GameTransitionGraph#981d- Ring
- 2
- Tier
- 2