No open-access location is known for this record yet.
No open-access location is known for this record yet.
We present a new game-theoretic analysis of an abstract auction game that captures essential strategic aspects of escalation phenomena. Two competitive adversaries commit resources irreversibly in order to win an indivisible prize; the winner will take the prize while both winner and loser incur the cost of their bids (investments). Following O'Neill (1986), we first reexamine a discrete version of the game and emphasize some strategic considerations that give rise to new bidding strategies of players. These new strategies, however, confirm O'Neill's result qualitatively: Rational players should not bid against each other. We then introduce a more general model of the game and show that escalatory competitive bids are compatible with equilibrium play. Equilibria with escalating bidding eventually realize a “draw”: Initial firmness (leading to escalation) is followed by conciliatory behavior that eventually implements a common commitment level.
Loading…
Stored only when both papers are in the corpus — 35 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.