Differential privacy (DP) gives a rigorous framework for data privacy by giving guarantees on the information leakage for individual data points from the output of an algorithm.

Paper by: Peter Frazier and Angela Yu (NIPS 2007).

Meta-complexity refers to the study of complexity of problems that are themselves about computational complexity. The canonical meta-complexity problem in the Boolean world is MCSP (Minimum Circuit Size Problem).

We consider two-player stochastic games on a graph. Two-player stochastic games are a generalization of  two-player games and Markov decision processes. Each state in the graph is controlled by one of the two players P1 and P2.

In this thesis defense, we will discuss the following results.