C. Aiswarya, B. Bollig, and P. Gastin, An automata-theoretic approach to the verification of distributed algorithms, Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.340-353, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01241122

B. Aboba, E. Guttman, and S. Cheshire, Dynamic configuration of IPv4 link-local addresses, 2005.

T. Luca-de-alfaro, O. Henzinger, and . Kupferman, Concurrent reachability games, Theoretical Computer Science, vol.386, issue.3, pp.188-217, 2007.
DOI : 10.1016/j.tcs.2007.07.008

[. Außerlechner, S. Jacobs, and A. Khalimov, Tight Cutoffs for Guarded Protocols with Fairness, Proceedings of the 17th International Workshop on Verification, Model Checking , and Abstract Interpretation (VMCAI'16), pp.476-494, 2016.
DOI : 10.1007/978-3-662-49122-5_23

[. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, Parameterized Model Checking of Token-Passing Systems, Proceedings of the 15th International Workshop on Verification, Model Checking, and Abstract Interpretation (VMCAI'14), pp.262-281, 2014.
DOI : 10.1007/978-3-642-54013-4_15

M. Abadi, L. Lamport, and P. Wolper, Realizable and unrealizable specifications of reactive systems, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, ICALP '89, pp.1-17, 1989.
DOI : 10.1007/BFb0035748

R. Luca-de-alfaro and . Majumdar, Quantitative solution of omega-regular games, Journal of Computer and System Sciences, vol.68, issue.2, pp.374-397, 2004.
DOI : 10.1016/j.jcss.2003.07.009

[. Aminof, S. Rubin, and F. Zuleger, On the Expressive Power of Communication Primitives in Parameterised Systems, Proceedings of the 20th International Conference Logic Programming and Automated Reasoning (LPAR'15), volume 9450 of Lecture Notes in Computer Science, pp.313-328
DOI : 10.1007/978-3-662-48899-7_22

N. Baier, M. Bertrand, and . Größer, On decision problems for probabilistic Büchi automata, Foundations of Software Science and Computational Structures: 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software Proceedings, pp.287-301, 2008.
DOI : 10.1007/978-3-540-78499-9_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.7690

[. Bouyer, R. Brenguier, N. Markey, and M. Ummels, Nash equilibria in concurrent games with Büchi objectives, Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of LIPIcs Leibniz-Zentrum für Informatik, pp.375-386, 2011.

[. Bertrand, P. Fournier, and A. Sangnier, Playing with Probabilities in Reconfigurable Broadcast Networks, Proc. of FOSSACS, pp.134-148, 2014.
DOI : 10.1007/978-3-642-54830-7_9
URL : https://hal.archives-ouvertes.fr/hal-01082129

[. Bertrand, P. Fournier, and A. Sangnier, Distributed Local Strategies in Broadcast Networks, 26th International Conference on Concurrency Theory (CONCUR 2015), volume 42 of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.44-57
URL : https://hal.archives-ouvertes.fr/hal-01243595

J. R. Büchi and L. H. Landweber, Solving sequential conditions by finite-state strategies. Transactions of, pp.295-311, 1969.

P. Bouyer, N. Markey, M. Randour, A. Sangnier, and D. Stan, Reachability in networks of register protocols under stochastic schedulers, Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16) ? Part II of Leibniz International Proceedings in Informatics, pp.1-10614, 2016.

P. Bouyer, N. Markey, and D. Stan, Mixed Nash equilibria in concurrent games, Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.351-363, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01105081

P. Bouyer, N. Markey, and D. Stan, Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games, Proceedings of the 7th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'16), volume 226 of Electronic Proceedings in Theoretical Computer Science, pp.61-75, 2016.
DOI : 10.4204/EPTCS.226.5
URL : http://arxiv.org/abs/1609.04089

[. Brenguier, Nash Equilibria in Concurrent Games ? Application to Timed Games, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00827027

H. C. Bohnenkamp, H. Peter-van-der-stok, F. W. Hermanns, and . Vaandrager, Cost-optimization of the IPv4 zeroconf protocol, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings., pp.22-25, 2003.
DOI : 10.1109/DSN.2003.1209963

[. Chatterjee and L. Doyen, Partial-Observation Stochastic Games, ACM Transactions on Computational Logic, vol.15, issue.2, p.16, 2014.
DOI : 10.1145/2579821
URL : https://hal.archives-ouvertes.fr/hal-00714359

X. Chen, X. Deng, and S. Teng, Settling the complexity of computing two-player Nash equilibria, Journal of the ACM, vol.56, issue.3, p.14, 2009.
DOI : 10.1145/1516512.1516516

A. Cheng, J. Esparza, and J. Palsberg, Complexity results for 1-safe nets, Theoretical Computer Science, vol.147, issue.1-2, pp.117-136, 1995.
DOI : 10.1016/0304-3975(94)00231-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.8128

R. Condurache, E. Filiot, R. Gentilini, and J. Raskin, The complexity of rational synthesis, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.1-12115, 2016.

[. Chatterjee, A. Thomas, and . Henzinger, A survey of stochastic ??-regular games, Journal of Computer and System Sciences, vol.78, issue.2, pp.394-413, 2012.
DOI : 10.1016/j.jcss.2011.05.002

[. Chatterjee, Two-Player Nonzero-Sum ??-Regular Games, Proc. 16th International Conference on Concurrency Theory (CONCUR'05), pp.413-427, 2005.
DOI : 10.1007/11539452_32

K. Chatterjee, M. Jurdzi´nskijurdzi´nski, and R. Majumdar, On Nash Equilibria in Stochastic Games, Proc. 18th International Workshop on Computer Science Logic, pp.26-40, 2004.
DOI : 10.1007/978-3-540-30124-0_6
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA603326

A. Condon, The complexity of stochastic games. Information and Computation, pp.203-224, 1992.

A. Stephen and . Cook, The complexity of theorem-proving procedures, Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC '71, pp.151-158, 1971.

E. M. Clarke, M. Talupur, T. Touili, and H. Veith, Verification by Network Decomposition, Proceedings of the 15th International Conference on Concurrency Theory, pp.276-291, 2004.
DOI : 10.1016/0020-0190(88)90211-6
URL : https://hal.archives-ouvertes.fr/hal-00161110

A. Scott, D. S. Crosby, and . Wallach, Denial of service via algorithmic complexity attacks, Proceedings of the 12th Conference on USENIX Security Symposium SSYM'03, pp.3-3, 2003.

A. Durand-gasselin, J. Esparza, P. Ganty, and R. Majumdar, Model Checking Parameterized Asynchronous Shared-Memory Systems, Proceedings of the 27th International Conference on Computer Aided Verification (CAV'15), pp.67-84, 2015.
DOI : 10.1007/978-3-319-21690-4_5
URL : http://arxiv.org/abs/1505.06588

S. Demri and M. Jurdzi´nskijurdzi´nski, The covering and boundedness problems for branching vector addition systems, Journal of Computer and System Sciences, vol.79, issue.1, pp.23-38, 2013.
DOI : 10.1016/j.jcss.2012.04.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.256

S. Das, L. Krishna, A. Manasa, D. Trivedi, and . Wojtczak, On Pure Nash Equilibria in Stochastic Games, Theory and Applications of Models of Computation, pp.359-371, 2015.
DOI : 10.1007/978-3-319-17142-5_31

M. Duflot, M. Kwiatkowska, G. Norman, D. Parker, S. Peyronnet et al., Practical Applications of Probabilistic Model Checking to Communication Protocols, Formal Methods for Industrial Critical Systems: A Survey of Applications, pp.133-150, 2012.
DOI : 10.1002/9781118459898.ch7

G. Delzanno, A. Sangnier, R. Traverso, and G. Zavattaro, On the complexity of parameterized reachability in reconfigurable broadcast networks, Proceedings of the 32nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'12), volume 18 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.289-300, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00740518

[. Delzanno, A. Sangnier, and G. Zavattaro, Parameterized Verification of Ad Hoc Networks, Proceedings of the 21st International Conference on Concurrency Theory (CON- CUR'10), pp.313-327
DOI : 10.1007/978-3-642-15375-4_22

J. Esparza, A. Finkel, and R. Mayr, On the verification of broadcast protocols, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.352-359, 1999.
DOI : 10.1109/LICS.1999.782630

J. Esparza, P. Ganty, J. Leroux, and R. Majumdar, Verification of population protocols, Luca Aceto and David de Frutos Escrig 26th International Conference on Concurrency Theory (CONCUR 2015), volume 42 of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer In- formatik, pp.470-482, 2015.
DOI : 10.1007/s00236-016-0272-3
URL : http://dx.doi.org/10.4230/LIPIcs.CONCUR.2015.470

J. Esparza, P. Ganty, and R. Majumdar, Parameterized Verification of Asynchronous Shared-Memory Systems, Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), pp.124-140, 2013.
DOI : 10.1007/978-3-642-39799-8_8

[. Emerson and A. P. Sistla, Symmetry and model checking, Formal Methods in System Design, vol.61, issue.No. 1, pp.105-131, 1996.
DOI : 10.1007/BF00625970

J. Esparza, Keeping a crowd safe: On the complexity of parameterized verification (invited talk), Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS'14), volume 25 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.1-10, 2014.

]. A. Fin64 and . Fink, Equilibrium in a stochastic n-person game, J. Sci. Hiroshima Univ. Ser. A-I Math, vol.28, issue.1, pp.89-93, 1964.

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere ! Theoretical Computer Science, pp.63-92, 2001.
DOI : 10.1016/s0304-3975(00)00102-x
URL : http://doi.org/10.1016/s0304-3975(00)00102-x

J. Filar and K. Vrieze, Competitive Markov Decision Processes, 1996.
DOI : 10.1007/978-1-4612-4054-9

F. [. Gale and . Stewart, 13. Infinite Games with Perfect Information, chapter Contributions to the theory of games, pp.245-266, 1953.
DOI : 10.1515/9781400881970-014
URL : https://hal.archives-ouvertes.fr/in2p3-00013000

M. Steven, A. P. German, and . Sistla, Reasoning about systems with many processes, Journal of the ACM, vol.39, issue.3, pp.675-735, 1992.

M. Hague, Parameterised pushdown systems with non-atomic writes, Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.457-468, 2011.

[. Jurdzinski, Deciding the winner in parity games is in UP ??? co-UP, Information Processing Letters, vol.68, issue.3, pp.119-124, 1998.
DOI : 10.1016/S0020-0190(98)00150-1

[. Kakutani, A generalization of Brouwer's fixed point theorem. Duke Math, J, vol.8, issue.3, pp.457-459, 1941.

O. Kupferman, G. Perelli, and M. Y. Vardi, Synthesis with Rational Environments, pp.219-235
DOI : 10.1007/s10472-016-9508-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.684.4968

T. [. Kumar and . Shiau, Existence of Value and Randomized Strategies in Zero-Sum Discrete-Time Stochastic Dynamic Games, SIAM Journal on Control and Optimization, vol.19, issue.5, pp.617-634, 1981.
DOI : 10.1137/0319039

R. J. Lipton, The reachability problem requires exponential space, Research report, 1976.

M. Thomas, S. A. Liggett, and . Lippman, Short notes: Stochastic games with perfect information and time average payoff, SIAM Review, vol.11, issue.4, pp.604-607, 1969.

A. Donald and . Martin, Borel determinacy, Annals of Mathematics, vol.102, pp.363-371, 1975.

A. Donald and . Martin, The determinacy of Blackwell games, The Journal of Symbolic Logic, vol.63, issue.4, pp.1565-1581, 1998.

M. Minsky, Computation: Finite and Infinite Machines, 1967.

J. F. Nash, Equilibrium points in n-person games, Proceedings of the National Academy of Sciences, vol.8, issue.1, pp.48-49, 1950.
DOI : 10.1073/pnas.36.1.48
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1063129

[. Neumann, Zur Theorie der Gesellschaftsspiele, Mathematische Annalen, vol.100, issue.1, pp.295-320, 1928.
DOI : 10.1007/BF01448847

L. Martin and . Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1994.

[. Rackoff, The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-231, 1978.
DOI : 10.1016/0304-3975(78)90036-1

L. Halsey, P. M. Royden, and . Fitzpatrick, Real Analysis, 2010.

E. Louis, . Rosier, and . Hsu-chun-yen, A multiparameter analysis of the boundedness problem for vector addition systems, Journal of Computer and System Sciences, vol.32, issue.1, pp.105-135, 1986.

P. Secchi, Stationary Strategies for Recursive Games, Mathematics of Operations Research, vol.22, issue.2, pp.494-512, 1997.
DOI : 10.1287/moor.22.2.494

[. Selten, Spieltheoretische Behandlung eines Oligopolmodells mit Nachfrageträgheit, Zeitschrift für die gesamte Staatswissenschaft, vol.121, pp.301-324, 1965.

[. Selten, Reexamination of the perfectness concept for equilibrium points in extensive games, International Journal of Game Theory, vol.2, issue.1, pp.25-55, 1975.
DOI : 10.1007/BF01766400

S. Lloyd and . Shapley, A value for n-person games. Contributions to the theory of games, pp.307-317, 1953.

M. Sipser, Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 1997.
DOI : 10.1145/230514.571645

[. Secchi and W. D. Sudderth, Stay-in-a-set games, International Journal of Game Theory, vol.30, issue.4, pp.479-490, 2001.
DOI : 10.1007/s001820200092

M. Ummels, The Complexity of Nash Equilibria in Infinite Multiplayer Games, Proc. 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), pp.20-34, 2008.
DOI : 10.1007/978-3-540-78499-9_3

M. Ummels, Stochastic Multiplayer Games: Theory and Algorithms, 2010.
DOI : 10.5117/9789085550402
URL : http://publications.rwth-aachen.de/record/63898/files/3451.pdf

M. Ummels and D. Wojtczak, Decision Problems for Nash Equilibria in Stochastic Games, Proc. 23rd International Workshop on Computer Science Logic (CSL'09), pp.515-530, 2009.
DOI : 10.1007/978-3-540-78499-9_3

M. Ummels and D. Wojtczak, The Complexity of Nash Equilibria in Limit-Average Games, Proc. 22nd International Conference on Concurrency Theory (CONCUR'11), pp.482-496, 2011.
DOI : 10.1016/0304-3975(95)00188-3

M. Ummels and D. Wojtczak, The Complexity of Nash Equilibria in Limit-Average Games, 2011.
DOI : 10.1016/0304-3975(95)00188-3

M. Ummels and D. Wojtczak, The complexity of Nash equilibria in stochastic multiplayer games, Logical Methods in Computer Science, vol.7, issue.3, 2011.

J. , V. Neumann, and O. Morgenstern, Theory of Games and Economic Behavior, 1947.

U. Zwick and M. Paterson, The complexity of mean payoff games on graphs, Theoretical Computer Science, vol.158, issue.1-2, pp.343-359, 1996.
DOI : 10.1016/0304-3975(95)00188-3

. Dans-la-seconde-partie-du-manuscrit, nous nous intéressonsintéressonsà un modèle plus réaliste o` u le nombre d'agents n'est pas déterminédéterminéà l'avance, et l'observation de chaque joueur est imparfaite . Plus précisément, le nombre d'agents est un paramètre

. Puisque-le-paramètre-n-'est-pas-fixé, il n'est plus possible de considérer le graphe d'´ etat du système complet, et il est nécessaire de spécifier séparément le comportement de chaque agent, puis les modalités d'interaction entre agents. Dans le chapitre 6, nous discutons des différentes méthodes d'interactions envisagées dans l'´ etude des systèmes paramétrés