1. Ben-Sasson, E., Tauman-Kalai, A., Kalai, E.: An approach to bounded rationality. In: Proceedings of the 19th Neural Information Processing Systems Conference, pp. 145–152 (2007)
2. Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37, 156–189 (1988)
3. Chen, X., Deng, X., Teng, S.H.: Settling the complexity of two-player Nash equilibrium. J. ACM 53(3) (2009)
4. Courtois, N.T., Bahack, L.: On subversive miner strategies and block with holding attack in bitcoin digital currency (2014). arXiv preprint:
http://arxiv.org/abs/1402.1718
5. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 71–78 (2006)