I’m in the middle of the third book in Robert Caro’s biography of Lyndon Johnson. In brief, Caro’s thesis is that (1) Lyndon Johnson cares only about power, and (2) Lyndon Johnson is spectacularly skilled at politics. Moreover, (2) holds in a strong sense: Johnson is not simply skilled at politics, but far more skilled than nearly everyone around him. As a result, Johnson’s life is an example of asymmetric play in a theoretically symmetric game, and a beautiful illustration of how such asymmetric play is equivalent to the game itself having asymmetric rules.

I’ve used Thomas Wang’s integer hash functions for years for various purposes. Using techniques invented by Bob Jenkins for general hashing (e.g., hashes of strings), Wang derived several hash specialized for fixed size integer input. His 64-bit version is
uint64_t hash(uint64_t key) { key = (~key) + (key << 21); // key = (key << 21) - key - 1; key = key ^ (key >> 24); key = (key + (key << 3)) + (key << 8); // key * 265 key = key ^ (key >> 14); key = (key + (key << 2)) + (key << 4); // key * 21 key = key ^ (key >> 28); key = key + (key << 31); return key; } Key properties include avalanche (changing any input bit changes about half of the output bits) and invertibility.

Consider the following simplified version of Texas holdem, with two players Alice and Bob:
Alice and Bob are each dealt two private cards.
Alice posts a small blind of 1, Bob posts a big blind of 2.
Alice either folds, calls, or raises by any amount $\ge 2$.
Bob either calls or folds.
Five more shared cards are dealt, and the winner is determined as usual.
Both Alice and Bob have infinite stack sizes, so only expected value matters.

Consider the following poker-like game, played with two players: Alice and Bob. Bob posts a blind of 1. Both players are dealt a single, continuous hand chosen uniformly at random from $[0,1]$. Alice can fold, call, or raise any amount $b \gt 0$ (calling means $b = 0$). Bob either calls or folds.
My original plan was to work out the Nash equilibrium for this game, and therefore derive interesting smooth curves describing the optimal way for Alice to bluff and generally obscure her hand.

Copyright © 2019, Geoffrey Irving. Powered by Hugo and Academic.