S. Bharathi, D. Kempe, and M. Salek, Competitive Influence Maximization in Social Networks, Internet and Network Economics, pp.306-311, 2007.
DOI : 10.1007/978-3-540-77105-0_31

´. E. Borel, La théorie du jeu et leséquationsleséquations intégralesintégralesà noyau symétrique. Comptes Rendus de l, Académie des Sciences, vol.173, pp.1304-1308, 1921.

´. E. Borel and J. Ville, Application de la théorie des probabilités aux jeux de hasard, 1938.

A. Borodin, Y. Filmus, O. , and J. , Threshold Models for Competitive Influence in Social Networks, Proceedings of the 6th International Conference on Internet and Network Economics, pp.539-550, 2010.
DOI : 10.1007/978-3-642-17572-5_48

G. C. Chasparis and J. Shamma, Control of preferences in social networks, 49th IEEE Conference on Decision and Control (CDC), pp.6651-6656, 2010.
DOI : 10.1109/CDC.2010.5717491

P. Clifford and A. Sudbury, A model for spatial conflict, Biometrika, vol.60, issue.3, pp.581-588, 1973.
DOI : 10.1093/biomet/60.3.581

P. Domingos and M. Richardson, Mining the network value of customers, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.57-66, 2001.
DOI : 10.1145/502512.502525

P. Dubey, R. Garg, M. , and B. , Competing for customers in a social network. Cowles Foundation Discussion Papers 1591, Cowles Foundation for Research in Economics, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01432210

E. Even-dar and A. Shapira, A note on maximizing the spread of influence in social networks, Proceedings of the 3rd International Conference on Internet and Network Economics (WINE'07), pp.281-286, 2007.

N. E. Friedkin, Norm formation in social influence networks, Social Networks, vol.23, issue.3, pp.167-189, 2001.
DOI : 10.1016/S0378-8733(01)00036-3

L. Friedman, Game-Theory Models in the Allocation of Advertising Expenditures, Operations Research, vol.6, issue.5, pp.699-709, 1958.
DOI : 10.1287/opre.6.5.699

J. Goldenberg, B. Libai, and E. Muller, Talk of the network: A complex systems look at the underlying process of word-ofmouth, Marketing Letters, vol.12, issue.3, pp.211-223, 2001.
DOI : 10.1023/A:1011122126881

R. Golman, P. , and S. E. , General Blotto: games of allocative strategic mismatch, Public Choice, vol.17, issue.7, pp.3-4, 2009.
DOI : 10.1007/s11127-008-9359-x

S. Goyal and M. Kearns, Competitive contagion in networks, Proceedings of the 44th Symposium on Theory of Computing STOC '12, pp.759-774

O. Gross, The symmetric blotto game, In RAND Corporation RM, p.424, 1950.

O. Gross and R. Wagner, A continuous colonel blotto game, In RAND Corporation RM, p.408, 1950.

X. He and D. Kempe, Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions, Lecture Notes in Computer Science, vol.8289, pp.232-248, 2013.
DOI : 10.1007/978-3-642-45046-4_20

R. A. Holley and T. M. Liggett, Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model, The Annals of Probability, vol.3, issue.4, pp.643-663, 1975.
DOI : 10.1214/aop/1176996306

D. Kempe, J. Kleinberg, T. , and ´. E. , Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.137-146, 2003.
DOI : 10.1145/956750.956769

D. Kempe, J. Kleinberg, T. , and ´. E. , Influential Nodes in a Diffusion Model for Social Networks, ICALP: Annual International Colloquium on Automata, Languages and Programming, 2005.
DOI : 10.1007/11523468_91

D. Kvasov, Contests with limited resources, Journal of Economic Theory, vol.136, issue.1, pp.738-748, 2007.
DOI : 10.1016/j.jet.2006.06.007

J. Laslier and N. Picard, Distributive Politics and Electoral Competition, Journal of Economic Theory, vol.103, issue.1, pp.106-130, 2002.
DOI : 10.1006/jeth.2000.2775

R. Mossel, On the submodularity of influence in social networks, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, 2007.
DOI : 10.1145/1250790.1250811

R. Motwani and P. And-raghavan, Randomized Algorithms, 1995.

J. Nash, Non-cooperative games, Annals of Mathematics, vol.54, pp.268-295, 1951.
DOI : 10.2307/1969529

G. Nemhauser, L. Wolsey, and M. Fisher, An analysis of approximations for maximizing submodular set functions???I, Mathematical Programming, vol.16, issue.1, pp.265-294, 1978.
DOI : 10.1007/BF01588971

M. Richardson, D. , and P. , Mining knowledge-sharing sites for viral marketing, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.61-70, 2002.
DOI : 10.1145/775047.775057

B. Roberson, The Colonel Blotto game, Economic Theory, vol.17, issue.1, pp.1-24, 2006.
DOI : 10.1007/s00199-005-0071-5

B. Szentes and R. W. Rosenthal, Three-object two-bidder simultaneous auctions: chopsticks and tetrahedra, Games and Economic Behavior, vol.44, issue.1, pp.114-133, 2003.
DOI : 10.1016/S0899-8256(02)00530-4

C. Thomas, N-dimensional blotto game with asymmetric battlefield values, 2013.

A. Vetta, Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.416-428, 2002.
DOI : 10.1109/SFCS.2002.1181966