Traveler's Dilemma¶
Isolate recursion depth as the variable governing whether an iterated-dominance equilibrium predicts behavior — using the same weak-dominance move as the Prisoner's Dilemma chained 98 times, so the $2 prediction evaporates while behavior tracks an incentive gradient the concept is blind to.
Core Idea¶
The Traveler's Dilemma (Basu, 1994) is a two-player game demonstrating the fragility of deep iterated dominance. Two travelers claim a value between $2 and $100; both are paid the lower claim, with a bonus to the lower claimant and a penalty to the higher. The unique Nash equilibrium — both claim $2 — is reached by chaining the identical weak-dominance move 98 times. Experimentally, subjects claim near $100, and behavior tracks the bonus/penalty magnitude the equilibrium is blind to.
Scope of Application¶
The Traveler's Dilemma lives within one substrate — strategic games solved by iterated dominance — specifically settings with a deep chain of undercut-driven eliminations; its reach is unusually narrow.
- Game-theory pedagogy — the canonical exhibit that iterated dominance is fragile at depth.
- Behavioral economics — a test bed for bounded rationality, level-k, and Quantal Response Equilibrium.
- Industrial organization — Bertrand competition as the same undercutting structure.
- Auction and pricing design — any mechanism rewarding small-margin undercutting on a finite grid.
- The centipede game — the sequential-tree cousin carrying the same critique.
Clarity¶
Naming the Traveler's Dilemma makes legible that iterated dominance degrades with recursion depth: the Prisoner's Dilemma settles in one round and predicts well, while the identical move chained 98 times evaporates. It sharpens the distinction between an equilibrium being logically derivable and being behaviorally predictive, and points to the right repair — an error-tolerant model like Quantal Response Equilibrium.
Manages Complexity¶
Whether an iterated-dominance equilibrium is trustworthy had been a case-by-case verdict. The dilemma compresses it onto one scalar — the depth of the dominance chain — by holding the logical move fixed against the Prisoner's Dilemma. That sits inside a two-axis decomposition: recursion depth sets whether the prediction fails, and the incentive gradient sets where boundedly-rational behavior lands, with a known repair keyed to both.
Abstract Reasoning¶
The game licenses diagnostic reasoning (counting recursion depth and reading behavioral validity off it, detecting the parameter-blindness dissociation), interventionist reasoning (modeling deep-recursion games with error-tolerant equilibria and steepening the penalty to move behavior), boundary-drawing (separating logically-derivable from behaviorally-predictive equilibria), and predictive reasoning about high claims and the gradient's direction.
Knowledge Transfer¶
Within game theory the dilemma transfers as mechanism to settings sharing a deep undercut-driven chain — Bertrand competition, undercutting auctions, the centipede game — genuine recognition of the same depth-driven fragility. Beyond game theory the construction itself does not travel: there is no non-strategic "Traveler's Dilemma." The lesson it dramatizes is carried by the parents Nash Equilibrium and Bounded Rationality; the airline-and-antiques scaffolding stays home.
Relationships to Other Abstractions¶
Current abstraction Traveler's Dilemma Domain-specific
Parents (2) — outgoing typed relations
-
Traveler's Dilemma includes Dominated Strategy Domain-specific
Traveler's Dilemma contains a 98-step chain of weakly dominated claims whose iterative elimination produces its behaviorally fragile endpoint.
-
Traveler's Dilemma is a decomposition of Bounded Rationality Prime
Removing the claim game leaves the limited-depth principle that a valid inference chain can cease to predict behavior when it exceeds agents' reasoning budget.
Hierarchy paths (7) — routes to 6 parentless roots
- Traveler's Dilemma → includes Dominated Strategy → is a kind of Game-Theoretic Strategy → is a decomposition of Function (Mapping)
- Traveler's Dilemma → is a decomposition of Bounded Rationality → is a decomposition of Constraint
- Traveler's Dilemma → is a decomposition of Bounded Rationality → presupposes Decision → presupposes Constraint
- Traveler's Dilemma → is a decomposition of Bounded Rationality → presupposes Decision → presupposes Reversibility and Irreversibility
- Traveler's Dilemma → is a decomposition of Bounded Rationality → presupposes Decision → is a decomposition of Stage Gate Process → is a kind of, typical Sequencing → presupposes Dependency
- Traveler's Dilemma → is a decomposition of Bounded Rationality → presupposes Decision → is a decomposition of Stage Gate Process → is a kind of, typical Sequencing → is a kind of Optimization
- Traveler's Dilemma → is a decomposition of Bounded Rationality → presupposes Decision → is a decomposition of Stage Gate Process → is a kind of, typical Sequencing → presupposes Time
Neighborhood in Abstraction Space¶
Traveler's Dilemma sits in a crowded region of the domain-specific corpus (23rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Game-Theoretic Models & Paradoxes (38 abstractions)
Nearest neighbors
- Guess ⅔ of the Average — 0.90
- Beauty Contest Game — 0.90
- Centipede Game — 0.90
- Ultimatum Game — 0.90
- Dominated Strategy — 0.89
Computed from structural-signature embeddings · 2026-10-25