Author:
Conitzer Vincent,Deng Yuan,Dughmi Shaddin
Publisher
Springer International Publishing
Reference18 articles.
1. Abernethy, J., Bartlett, P.L., Hazan, E.: Blackwell approachability and no-regret learning are equivalent. In: Proceedings of the 24th Annual Conference on Learning Theory, pp. 27–46 (2011)
2. Aumann, R.J., Maschler, M.: Repeated games with incomplete information. MIT Press, Cambridge (1995)
3. Bhaskar, U., Cheng, Y., Ko, Y.K., Swamy, C.: Hardness results for signaling in Bayesian zero-sum and network routing games. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 479–496 (2016)
4. Blackwell, D.: An analog of the minimax theorem for vector payoffs. Pac. J. Math. 6(1), 1–8 (1956)
5. Borgs, C., Chayes, J., Immorlica, N., Kalai, A.T., Mirrokni, V., Papadimitriou, C.: The myth of the folk theorem. Games Econ. Behav. 70(1), 34–43 (2010)