Cached correlated randomization: a tweak to UDT in adversarial games

Just recently had this idea, pulling it out of comments so it gets more visibility. Jessicata pointed me to a game proposed by Wichardt in 2008. I'll paste her summary: suppose Alice has 2 copies, who have the same source code and who can randomize independently. There are 2 coffee shops that the copies can decide to go to without communicating. They would really like (+5) to meet at the same coffee shop. Also, Bob hates Alice, his utility function is hers negated. Alice gets −1 utility (and Bob...