Computer Science/Discrete Mathematics Seminar I

Achieving correlated equilibrium is a problem at the intersection of game theory, cryptography and efficient algorithms. Thus far, however, perfectly rational solutions have been lacking, and the problem has been formulated with somewhat limited objectives. We put forward a stronger and more general interpretation of the problem, and yet prove that it is rationally solvable via ballots and a ballot box. In cryptographic terms, our contribution consists of putting forward and implementing TRANSPARENT COMPUTING, a new and stricter notion of private-and-correct computation. (Joint work with Izmalkov, Lepinski and Shelat)