E. Anshelevich, A. Dasgupta, E. Tardos, and T. Wexler, Near-optimal network design with selfish agents, STOC, pp.511-520, 2003.
DOI : 10.1145/780542.780617
URL : http://www.cs.ust.hk/mjg_lib/Classes/COMP670O/Papers/p511-anshelevich.pdf

E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler et al., The price of stability for network design with fair cost allocation, FOCS, pp.295-304, 2004.

M. Anthony and P. L. Bartlett, Neural Network Learning: Theoretical Foundations, 2009.
DOI : 10.1017/cbo9780511624216

M. F. Balcan, A. Blum, J. D. Hartline, and Y. Mansour, Mechanism design via machine learning, FOCS, pp.605-614, 2005.
DOI : 10.1109/sfcs.2005.50

M. Balcan, A. Blum, S. Fine, and Y. Mansour, Distributed learning, communication complexity and privacy, COLT, vol.22, pp.26-27, 2012.

M. Balcan, A. D. Procaccia, and Y. Zick, Learning cooperative games, IJCAI, pp.475-481, 2015.

E. Balkanski, U. Syed, and S. Vassilvitskii, Statistical cost sharing, NIPS, pp.6221-6230, 2017.

J. Baxter, A bayesian/information theoretic model of learning to learn viamultiple task sampling, Machine Learning, vol.28, issue.1, pp.7-39, 1997.

S. Ben-david, J. Blitzer, K. Crammer, A. Kulesza, F. Pereira et al., A theory of learning from different domains, Machine Learning, vol.79, issue.1-2, pp.151-175, 2010.
DOI : 10.1007/s10994-009-5152-4
URL : https://link.springer.com/content/pdf/10.1007%2Fs10994-009-5152-4.pdf

J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. Wortman, Learning bounds for domain adaptation, NIPS, pp.129-136, 2007.

A. Blum and J. D. Hartline, Near-optimal online auctions, SODA, pp.1156-1163, 2005.

A. Blum, V. Kumar, A. Rudra, and F. Wu, Online learning in online auctions, SODA, pp.202-204, 2003.

A. Blum, N. Haghtalab, A. D. Procaccia, and M. Qiao,

, Collaborative pac learning, NIPS, pp.2392-2401

M. Brückner and T. Scheffer, Stackelberg games for adversarial prediction problems, ACM SIGKDD, pp.547-555, 2011.

R. Caruana, Multitask learning, Machine Learning, vol.28, issue.1, pp.41-75, 1997.

H. Chen and T. Roughgarden, Network design with weighted players, Theoretical Computer Science, vol.45, issue.2, pp.302-324, 2009.

C. Claus and C. Boutilier, The dynamics of reinforcement learning in cooperative multiagent systems, AAAI, pp.746-752, 1998.

O. Dekel, F. Fischer, and A. D. Procaccia, Incentive compatible regression learning, Journal of Computer and System Sciences, vol.76, issue.8, pp.759-777, 2010.

L. Dritsoula, P. Loiseau, and J. Musacchio, A gametheoretic analysis of adversarial classification, IEEE Transactions on Information Forensics and Security, vol.12, issue.12, pp.3094-3109, 2017.

C. Dwork, R. , and A. , The algorithmic foundations of differential privacy, Foundations and Trends in Theoretical Computer Science, vol.9, issue.3, pp.211-407, 2014.

C. Dwork, Differential privacy, ICALP, pp.1-12, 2006.

Y. Freund and R. E. Schapire, Adaptive game playing using multiplicative weights, Games and Economic Behavior, vol.29, issue.1-2, pp.79-103, 1999.

S. Herzog, S. Shenker, and D. Estrin, Sharing the cost of multicast trees: An axiomatic analysis, SIGCOMM Comput. Commun. Rev, vol.25, issue.4, pp.315-327, 1995.

J. Hu and M. P. Wellman, Nash q-learning for general-sum stochastic games, Journal of Machine Learning Research, vol.4, pp.1039-1069, 2003.

A. Kumar, I. , and H. D. , Learning task grouping and overlap in multi-task learning, ICML, pp.1103-1110, 2012.

W. Liu and S. Chawla, A game theoretical model for adversarial learning, ICDM Workshops, pp.25-30, 2009.

T. Liu, W. Chen, and T. Qin, Mechanism learning with mechanism induced data, AAAI, pp.4037-4041, 2015.

Y. Mansour, M. Mohri, and A. Rostamizadeh, Domain adaptation: Learning bounds and algorithms, 2009.

Y. Mansour, M. Mohri, and A. Rostamizadeh, Multiple source adaptation and the rényi divergence, UAI, pp.367-374, 2009.

R. Meir, A. D. Procaccia, and J. S. Rosenschein, Algorithms for strategyproof classification, Artificial Intelligence, vol.186, pp.123-156, 2012.

J. F. Nash, Equilibrium points in n-person games, National Academy of Sciences of the USA, vol.36, pp.48-49, 1950.

J. F. Nash, Non-cooperative games, Annals of Mathematics, vol.54, issue.2, pp.286-295, 1951.

L. Panait, L. , and S. , Cooperative multi-agent learning: The state of the art, Autonomous Agents and MultiAgent Systems, vol.11, issue.3, pp.387-434, 2005.

L. Peshkin, K. Kim, N. Meuleau, and L. P. Kaelbling, Learning to cooperate via policy search, UAI, pp.489-496, 2000.

D. Schuurmans and M. A. Zinkevich, Deep learning games, NIPS, pp.1678-1686, 2016.

S. Shalev-shwartz and Y. Singer, Convex repeated games and fenchel duality, NIPS, pp.1265-1272, 2007.

S. Shalev-shwartz and Y. Singer, A primal-dual perspective of online learning algorithms, Machine Learning, vol.69, issue.2-3, pp.115-142, 2007.

L. S. Shapley, A value for n-person games, Contributions to the Theory of Games, vol.II, pp.307-317, 1953.

H. K. Shiva-prasad-kasiviswanathan, K. N. Lee, and A. Smith, What can we learn privately?, SIAM Journal on Computing, vol.40, issue.3, pp.793-826, 2011.

L. G. Valiant, A theory of the learnable, Communications of the ACM, vol.27, pp.1134-1142, 1984.

J. Wang, M. Kolar, and N. Srerbo, Distributed multitask learning, AISTATS, pp.751-760, 2016.