Given the portion of the investment graph you actually own, find the tractable paths forward.
Links: Gaming, Bilateral Trade Valuation, The Multiplayer Coalition Problem, The Nash Bargaining Problem, Monopoly, Insurance, Risk and Entrepreneurship
The full Monopoly investment space is combinatorial: 28 properties, 5 house levels each, trades between 2-4 players, variable cash positions. Evaluating all possible futures from any game state is intractable. The bilateral trade valuation model showed how to evaluate individual trades correctly, and the multiplayer coalition problem showed why the full multiplayer space resists solution.
But there’s a structural reduction hiding in plain sight: you don’t own the whole graph. Each player owns a subgraph of the property space, and at any decision point, the set of actually available actions is far smaller than the theoretical space. The problem isn’t “what’s the best portfolio?” — it’s “given what I hold right now, what’s the best use of my next dollar?”
This is Markowitz’s efficient frontier applied under real constraints. CAPM assumes frictionless, liquid markets where you can always rebalance to the frontier. Monopoly has massive friction: trades require willing counterparties, assets are discrete and illiquid, and the opportunity cost of waiting for a better trade is concrete (your opponent is building houses while you hold cash).
The Monopoly board is a graph where:
The superadditivity is the key structural feature. It means the topology of your subgraph matters more than its size. A player with one complete clique (3 connected nodes) dominates a player with scattered nodes across 4 incomplete sets, even if the scattered player “owns more.”
At any game state, the property graph is partitioned among players (plus unowned nodes). Each player’s subgraph has:
The depth of a subgraph is its development level — how many houses are built on complete cliques. The topology is which cliques are complete vs partial vs isolated.
At each decision point, you have exactly two types of action:
BUILD (deepen your subgraph):
TRADE (restructure your subgraph topology):
The bilateral trajectory model already showed this empirically (33.1% win rate, Z=10.25). The graph framework explains why:
A build action has execution probability = 1.0 (if you have cash). A trade has execution probability = P(counterparty agrees), which requires:
In practice, this product of conditions is small. The expected value of a trade is EV(trade) x P(execution). Even when EV(trade) >> EV(build), the probability discount often kills it.
For a trade to be mutually beneficial, both players must improve their subgraph topology. But in Monopoly, completing YOUR clique often means giving the opponent a node that completes THEIRS. The set of trades where both players complete a set without the other also completing one is small and game-state dependent.
More precisely: a trade is feasible when the subgraph partition is such that both players hold fragments of different cliques and can swap to each complete one. This is a graph matching problem — finding complementary subgraph completions. The matching exists in specific states but not generically.
While you hold cash waiting for a trade that may never happen, your opponent is building. Every turn you don’t build, you forgo the rent income that house would generate. The bilateral trajectory model makes this visible: the “do nothing, wait for trade” trajectory falls further behind the “build now” trajectory with each passing turn.
This connects to the interest rate framework: cash earns 0% return. Houses earn property-EPT. Holding cash is a bet that a future trade will yield more than the cumulative property-EPT you’re forgoing. That bet rarely pays off.
At any game state, the set of non-dominated actions (actions where no other action is better in every dimension) is small:
Most of the combinatorial space is dominated. You never need to consider building the 1st house on your worst set before the 3rd house on your best set. You never need to consider a trade that gives your opponent a monopoly without getting one yourself. Dominance pruning collapses the action space to a handful of candidates.
For each buildable house on each complete set:
Rank by ROI. This is the efficient frontier of deterministic investments.
For each opponent, check: is there a swap of partial-clique fragments that completes a clique for both? This is the graph matching step — find complementary completions.
For each feasible trade:
The decision rule: take the action with highest risk-adjusted EV.
Your BATNA (best alternative to negotiated agreement) is always the build option. This sets the floor for any trade:
This is the Nash bargaining solution applied to subgraph optimization: the disagreement point is “both players just build what they have.”
The full combinatorial space of all possible investments across all players is enormous. But from any single player’s perspective at a single decision point:
This is the “good news” — the problem is much smaller than the full combinatorial space because:
The hard problem — “find the globally optimal strategy across all possible game states” — collapses to the tractable problem: “given my subgraph right now, which of these 2-3 non-dominated actions should I take?”
Each player is simultaneously solving this same subgraph optimization problem. The interaction comes through:
The housing scarcity point connects back to the “build what you got” insight: in a 4-player game, building early doesn’t just improve your position — it claims scarce housing inventory, worsening other players’ build frontiers. This is an externality of the build decision that the bilateral model can capture but the isolated growth curve cannot.
The sequence of decisions forms a DAG (directed acyclic graph):
From any node, the reachable set is small (the 2-3 non-dominated actions). The DAG fans out, but each level has low branching factor because of dominance pruning. Navigating the DAG = picking the highest-EV edge at each node.
This is dynamic programming on a state graph where:
The Markov landing probabilities feed into the reward calculation. The bilateral simulation computes the reward. The graph structure determines the action space. Each piece of existing theory slots into the framework.
The full subgraph optimization problem isn’t analytically solvable — you can’t prove that “build the 3rd house on Orange” is the Nash equilibrium move from a given state. But the pattern across this vault’s game research is that real-world constraints and dominant strategies reduce the problem space until iterative convergence finds the right answer anyway.
This is visible in the existing results:
The pattern: when constraints are tight enough, multiple reasonable approaches converge to the same solution. You don’t need mathematical rigor to find it — you need a model that respects the constraints and an iteration loop.
This connects directly to computational irreducibility. The full game state space is irreducible — no shortcut to the optimal play sequence. But the decision at each node is reducible because dominance pruning, constraint satisfaction, and convergence dynamics collapse the choice set. The game is irreducible globally but tractable locally. You can’t solve the whole DAG, but you can navigate it one node at a time, and convergence ensures that local greedy decisions approximate the global optimum.
The practical implication for implementation: don’t try to solve the framework analytically. Build the bilateral simulation, apply the dominance pruning, iterate. If the result converges (as it has at every prior step), the solution is correct enough. The constraints do the mathematical work that closed-form solutions would otherwise require.