1 paper
Michele Budinich, Lance Fortnow
We consider a repeated Matching Pennies game in which players have limited access to randomness. Playing the (unique) Nash equilibrium in this n-stage game requires n random bits.…