. Enfin, les modèles de jeux sur réseau social présentés ne s'intéressent pas aux messages ´ echangés Si les messages sont générés par les joueurs selon un jeù a paramètres dont la valeur n'est pas connue, peut-on estimer la valeur de ces paramètresparamètresà partir d'observations partielles de ces messages ? En particulier

C. Bibliographie, P. W. Daskalakis, C. H. Goldberg, and . Papadimitriou, The complexity of computing a nash equilibrium, STOC, pp.71-78, 2006.

N. Megiddo and C. H. Papadimitriou, On total functions, existence theorems and computational complexity, Theoretical Computer Science, vol.81, issue.2, pp.317-324, 1991.
DOI : 10.1016/0304-3975(91)90200-L
URL : http://doi.org/10.1016/0304-3975(91)90200-l

G. W. Brown, Iterative solutions of games by fictitious play, Activity Analysis of Production and Allocation, pp.374-376, 1951.

J. Robinson, An Iterative Method of Solving a Game, The Annals of Mathematics, vol.54, issue.2, pp.296-301, 1951.
DOI : 10.2307/1969530

N. Harold and . Shapiro, Note on a computation method in the theory of games, Communications on Pure and Applied Mathematics, vol.11, issue.4

F. Brandt, F. Fischer, and P. Harrenstein, On the rate of convergence of fictitious play, Proceedings of the Third international conference on Algorithmic game theory, 2010.

J. Michael, Y. Kearns, and . Mansour, Efficient nash computation in large population games with bounded influence, UAI, pp.259-266, 2002.

R. J. Lipton, E. Markakis, and A. Mehta, Playing large games using simple strategies, Proceedings of the 4th ACM conference on Electronic commerce , EC '03, p.3, 2003.
DOI : 10.1145/779928.779933

X. Chen and X. Deng, Settling the Complexity of Two-Player Nash Equilibrium, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006.
DOI : 10.1109/FOCS.2006.69

C. Daskalakis, A. Mehta, and C. H. Papadimitriou, A note on approximate nash equilibria, WINE, pp.297-306, 2006.

C. Daskalakis, A. Mehta, and C. H. Papadimitriou, Progress in approximate nash equilibria, Proceedings of the 8th ACM conference on Electronic commerce , EC '07, pp.355-358, 2007.
DOI : 10.1145/1250910.1250962

T. Feder, H. Nazerzadeh, and A. Saberi, Approximating nash equilibria using small-support strategies, Proceedings of the 8th ACM conference on Electronic commerce , EC '07, p.7, 2007.
DOI : 10.1145/1250910.1250961

H. Tsaknakis and P. G. Spirakis, An Optimization Approach for Approximate Nash Equilibria, Internet Mathematics, vol.5, issue.4, pp.365-382, 2008.
DOI : 10.1080/15427951.2008.10129172

S. Chien and A. Sinclair, Convergence to approximate Nash equilibria in congestion games, SODA, pp.169-178, 2007.
DOI : 10.1016/j.geb.2009.05.004

S. Albers and P. Lenzner, On approximate nash equilibria in network design, Proceedings of the 6th international conference on Internet and network economics, 2010.

D. Michael, L. G. Grigoriadis, and . Khachiyan, A sublinear-time randomized approximation algorithm for matrix games, Oper. Res. Lett, vol.18, issue.2, 1995.

S. Arora, E. Hazan, and S. Kale, The multiplicative weights update method : a meta-algorithm and applications, pp.121-164, 2012.

A. Fabrikant, C. H. Papadimitriou, and K. Talwar, The complexity of pure Nash equilibria, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.604-612, 2004.
DOI : 10.1145/1007352.1007445

H. Ackermann, H. Röglin, and B. Vöcking, On the impact of combinatorial structure on congestion games, FOCS, pp.613-622, 2006.

S. Ieong, R. Mcgrew, and E. Nudelman, Yoav Shoham, and Qixiang Sun. Fast and compact : A simple class of congestion games, AAAI, pp.489-494, 2005.

A. Bhalgat, T. Chakraborty, and S. Khanna, Nash Dynamics in Congestion Games with Similar Resources, WINE, pp.362-373, 2009.
DOI : 10.1007/978-3-642-10841-9_33

A. Skopalik and B. Vöcking, Inapproximability of pure nash equilibria, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.355-364, 2008.
DOI : 10.1145/1374376.1374428

D. Gale and L. S. Shapley, College Admissions and the Stability of Marriage, The American Mathematical Monthly, vol.69, issue.1, pp.9-15
DOI : 10.2307/2312726

W. Robert, D. Irving, and . Manlove, The stable roommates problem with ties, J. Algorithms, vol.43, issue.1, pp.85-105, 2002.

H. Ackermann, P. W. Goldberg, and V. S. Mirrokni, Heiko Röglin, and Berthold Vöcking. A unified approach to congestion games and two-sided markets

E. Arcaute and S. Vassilvitskii, Social Networks and Stable Matchings in the Job Market, WINE, pp.220-231, 2009.
DOI : 10.1007/978-3-642-10841-9_21

M. Hoefer, Local matching dynamics in social networks, Information and Computation, vol.222, pp.20-35, 2013.
DOI : 10.1016/j.ic.2012.10.005

J. Hofbauer, S. Sorin, and Y. Viossat, Time Average Replicator and Best-Reply Dynamics, Mathematics of Operations Research, vol.34, issue.2, pp.263-269, 2009.
DOI : 10.1287/moor.1080.0359
URL : https://hal.archives-ouvertes.fr/hal-00360767

D. Monderer and L. S. Shapley, Fictitious Play Property for Games with Identical Interests, Journal of Economic Theory, vol.68, issue.1, pp.258-265, 1996.
DOI : 10.1006/jeth.1996.0014

U. Berger, Brown's original fictitious play, Journal of Economic Theory, vol.135, issue.1, pp.572-578, 2007.
DOI : 10.1016/j.jet.2005.12.010

L. S. Shapley and R. Calif, 1. Some Topics in Two-Person Games, 1963.
DOI : 10.1515/9781400882014-002

F. Teytaud and O. Teytaud, Lemmas on partial observation, with application to phantom games, 2011 IEEE Conference on Computational Intelligence and Games (CIG'11), pp.243-249, 2011.
DOI : 10.1109/CIG.2011.6032013
URL : https://hal.archives-ouvertes.fr/inria-00625794

E. Koutsoupias and C. H. Papadimitriou, Worst-case equilibria, STACS, pp.404-413, 1999.
DOI : 10.1007/3-540-49116-3_38

T. Roughgarden and . Tardos, How bad is selfish routing?, Journal of the ACM, vol.49, issue.2, pp.236-259, 2002.
DOI : 10.1145/506147.506153
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.8926

G. Christodoulou and E. Koutsoupias, The price of anarchy of finite congestion games, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing , STOC '05, pp.67-73, 2005.
DOI : 10.1145/1060590.1060600

T. Roughgarden and M. Sundararajan, Optimal Efficiency Guarantees for Network Design Mechanisms, IPCO, pp.469-483, 2007.
DOI : 10.1007/978-3-540-72792-7_35

G. Christodoulou, E. Koutsoupias, and P. G. Spirakis, On the performance of approximate equilibria in congestion games, ESA, pp.251-262, 2009.

A. Vittoriobiì-o, M. Celi, V. Flammini, and . Gallotti, Social context congestion games, Proceedings of the 18th international conference on Structural information and communication complexity, pp.282-293, 2011.

R. Kleinberg and G. Piliouras, Multiplicative updates outperform generic no-regret learning in congestion games, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.533-542, 2009.
DOI : 10.1145/1536414.1536487

R. W. Rosenthal, A class of games possessing pure-strategy Nash equilibria, International Journal of Game Theory, vol.2, issue.1, pp.65-67, 1973.
DOI : 10.1007/BF01737559

X. Michel, L. Goemans, V. S. Li, M. Mirrokni, and . Thottan, Market sharing games applied to content distribution in ad hoc networks, IEEE Journal on Selected Areas in Communications, vol.24, issue.5, pp.1020-1033, 2006.

T. Roughgarden and . Tardos, Bounding the inefficiency of equilibria in nonatomic congestion games, Games and Economic Behavior, vol.47, issue.2, pp.389-403, 2004.
DOI : 10.1016/j.geb.2003.06.004

S. Fischer, H. Räcke, and B. Vöcking, Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods, SIAM Journal on Computing, vol.39, issue.8, pp.3700-3735, 2010.
DOI : 10.1137/090746720

T. Harks and M. Klimm, On the Existence of Pure Nash Equilibria in Weighted Congestion Games, Mathematics of Operations Research, vol.37, issue.3, pp.419-436, 2012.
DOI : 10.1287/moor.1120.0543

I. Milchtaich, Weighted congestion games with separable preferences, Games and Economic Behavior, vol.67, issue.2, pp.750-757, 2009.
DOI : 10.1016/j.geb.2009.03.009

I. Milchtaich, Congestion Games with Player-Specific Payoff Functions, Games and Economic Behavior, vol.13, issue.1, pp.111-124, 1996.
DOI : 10.1006/game.1996.0027

M. Mavronicolas, I. Milchtaich, B. Monien, and K. Tiemann, Congestion Games with Player-Specific Constants, MFCS, pp.633-644, 2007.
DOI : 10.1007/978-3-540-74456-6_56

T. Harks, M. Hoefer, M. Klimm, and A. Skopalik, Computing pure nash and strong equilibria in bottleneck congestion games, pp.29-38, 2010.

R. Kannan and C. Busch, Bottleneck Congestion Games with Logarithmic Price of Anarchy, SAGT, pp.222-233, 2010.
DOI : 10.1007/s00453-006-1211-4

B. Escoffier, L. Gourves, and J. Monnot, The Price of Optimum in a Matching Game, Proceedings of the 4th international conference on Algorithmic game theory, pp.81-92, 2011.
DOI : 10.1007/978-3-642-24829-0_9

D. J. Abraham, A. Levavi, D. Manlove, and G. Malley, The Stable Roommates Problem with Globally Ranked Pairs, Internet Mathematics, vol.5, issue.4, pp.493-515, 2008.
DOI : 10.1080/15427951.2008.10129167

K. Elbiassoni, Lecture's note on randomized fictitious play

F. Magniez, M. Michel-de-rougemont, X. Santha, and . Zeitoun, The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays, WINE, pp.266-277, 2011.
DOI : 10.1007/978-3-642-25510-6_23
URL : https://hal.archives-ouvertes.fr/hal-00580815

D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, How easy is local search?, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.79-100, 1988.
DOI : 10.1109/SFCS.1985.31

A. A. Schäffer and M. Yannakakis, Simple Local Search Problems that are Hard to Solve, SIAM Journal on Computing, vol.20, issue.1, pp.56-87, 1991.
DOI : 10.1137/0220004

R. Kannan and T. Theobald, Games of fixed rank: a hierarchy of bimatrix games, SODA, pp.1124-1132, 2007.
DOI : 10.1007/s00199-009-0436-2

A. Schrijver, Combinatorial Optimization -Polyhedra and Efficiency, 2003.

C. Daskalakis, On the complexity of approximating a nash equilibrium, SODA, pp.1498-1517, 2011.

I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.532-541, 2011.
DOI : 10.1109/FOCS.2011.50

M. Hoefer and L. Wagner, Locally stable matching with general preferences

X. Zeitoun, Le gain de l'exploration dans les jeux de couplage sur réseau social, 14ème Congrès de la Société Française de Recherche Opérationnelle et d'Aidè a la Décision, 2013.

D. Eppstein, M. T. Goodrich, M. Löffler, D. Strash, and L. Trott, Category-based routing in social networks : Membership dimension and the small-world phenomenon, pp.102-107, 2011.

B. Doerr, M. Fouz, and T. Friedrich, Social Networks Spread Rumors in Sublogarithmic Time, Electronic Notes in Discrete Mathematics, vol.38, pp.303-308, 2011.
DOI : 10.1016/j.endm.2011.09.050