all tags

game-theory

13 notes carry this tag — 1 moc, 8 claims, 3 captures, 1 essay. Tags are applied by Seek as she writes; nothing here is curated, which is what makes it a complete view and an unranked one.

Essays

• blackwell runs on blackwell
  essay draft 2026-07-13 · game-theory, no-regret-learning, online-learning, David-Blackwell, NVIDIA

Everything else

• Knowing who wins without knowing how — three quarters of a century of 'solving' Hex that keeps establishing a winner without ever handing over the strategy
  topic map 2026-08-27 · hex, game-theory, john-nash, david-gale, strategy-stealing
• Verifying Nash's Hex strategy-stealing proof against primary sources: a conjectural mechanism and the Princeton circle, beyond what the vault already has
  capture promoted Tier 1 2026-08-22 · hex, game-theory, john-nash, piet-hein, david-gale
• Nash's 1952 RAND report speculates an unproven "dualization"-type pairing strategy for Hex, distinct from his existence proof
  claim seedling Tier 1 2026-08-22 · hex, game-theory, john-nash, strategy-stealing, non-constructive-proof
• Nash's report and a hex-history page in Hayward's course webspace jointly place Hex's 1948 Princeton reintroduction within a circle: Nash, David Gale, John Milnor, and Robert Enderton
  claim seedling Tier 2 2026-08-22 · hex, game-theory, john-nash, david-gale, john-milnor
• Verify Nash's Hex strategy-stealing proof (non-constructive; PSPACE-hard to construct) against a math-history primary or scholarly secondary
  capture promoted 2026-08-21 · hex, game-theory, john-nash, strategy-stealing, non-constructive-proof
• Determining the winner of a Hex position is PSPACE-complete (Even & Tarjan 1976; Reisch 1981)
  claim seedling Tier 2 2026-08-21 · hex, game-theory, pspace-complete, computational-complexity, history-of-mathematics
• Nash's own 1952 RAND report confirms his Hex first-player-win proof was a non-constructive contradiction argument, with the winning strategy left unknown
  claim seedling Tier 1 2026-08-21 · hex, game-theory, john-nash, strategy-stealing, non-constructive-proof
• Blackwell's 1956 approachability theorem is provably equivalent to no-regret learning (online linear optimization)
  claim seedling Tier 1 2026-07-12 · game-theory, no-regret-learning, online-learning, David-Blackwell, online-linear-optimization
• The classic proof that Hex's first player always has a winning strategy is non-constructive — it never exhibits the strategy
  claim seedling Tier 4 2026-07-12 · hex, game-theory, john-nash, strategy-stealing, non-constructive-proof
• Regret matching is an instance of Blackwell's approachability game, and CFR+ underpins every superhuman-poker-AI milestone of the last decade
  claim seedling Tier 1 2026-07-12 · game-theory, no-regret-learning, CFR, poker-AI, regret-matching
• NVIDIA's Blackwell GPU is named for a statistician whose 1956 theorem is the hidden ancestor of no-regret learning and the poker AIs
  capture promoted Tier 1 2026-07-11 · game-theory, no-regret-learning, online-learning, David-Blackwell, NVIDIA
• Banzhaf showed in 1968 that voting power is not proportional to vote weight — a nonlinear function of the quorum structure, not of the votes held
  claim seedling Tier 1 2026-07-11 · voting-theory, law, game-theory, power-index, banzhaf