C. Amato, D. S. Bernstein, and S. Zilberstein, Optimizing Memory-Bounded Controllers for Decentralized POMDPs Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized POMDPs, Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence (UAI-07), 2007. [ADC07] Raghav Aras Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, 2007.

J. [. Anderson and . Moore, Time-varying feedback laws for decentralized control, Nineteenth IEEE Conference on Decision and Control including the Symposium on Adaptive Processes, pp.519-524, 1980.
DOI : 10.1109/TAC.1981.1102770

[. Azhar, A. Mclennan, and J. Reif, Computation of equilibriain noncooperative games, Computers & Mathematics with Applications, vol.50, issue.5-6, pp.823-854, 2005.
DOI : 10.1016/j.camwa.2005.02.015

R. Aumann, Mixed and Behavior Strategies in Infinite Extensive Games Advances in Game Theory, Annals of Mathematics Studies, vol.52, pp.627-650, 1967.

R. J. Aumann, Subjectivity and correlation in randomized strategies, Journal of Mathematical Economics, vol.1, issue.1, pp.67-96, 1974.
DOI : 10.1016/0304-4068(74)90037-8

]. M. Bal65 and . Balinski, Integer Programming: Methods, Uses, Computation, Management Science, vol.12, issue.3, pp.253-313, 1965.

A. Boularias and B. Chaib-draa, Exact Dynamic Programming For Decentralized POMDPs with Lossless Policy Compression, Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, 2008.

]. R. Bel57 and . Bellman, Dynamic Programming, 1957.

S. Daniel and . Bernstein, Complexity Analysis And Optimal Algorithms For Decentralized Decision Making, 2005.

[. Bernstein, R. Givan, N. Immerman, and S. Zilberstein, The Complexity of Decentralized Control of Markov Decision Processes, Mathematics of Operations Research, vol.27, issue.4, pp.819-840, 2002.
DOI : 10.1287/moor.27.4.819.297

D. S. Bernstein, E. Hansen, and S. Zilberstein, Bounded Policy Iteration for Decentralized POMDPs, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), 2005.

A. [. Beynier and . Mouaddib, An Iterative Algorithm For Solving Constrained Decentralized Markov Decision Processes, Proceedings of the Twenty-First National Conference on Artificial Intelligence, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01344436

R. Jean, D. Blair, M. Mutchler, . [. Van-lent, C. R. Blum et al., Perfect Recall and Pruning in Games with Imperfect Information A Continuation Method for Nash Equilibria in Structured Games, Computational Intelligence Journal of Artificial Intelligence Resarch, vol.12, issue.25, pp.131-154457, 1996.

R. Becker, S. Zilberstein, V. Lesser, and C. V. Goldman, Solving Transition Independent Decentralized Markov Decision Processes, Journal of Artificial Intelligence Research, vol.22, pp.423-455, 2004.
DOI : 10.1145/860575.860583

URL : http://anytime.cs.umass.edu/shlomo/papers/aamas03a.pdf

]. A. Cas98a and . Cassandra, A Survey Of POMDP Applications, 1998.

]. A. Cas98b and . Cassandra, Exact And Approximate Algorithms For Partially Observable Markov Decision Processes, 1998.

R. Cogill and S. Lall, An Approximation Algorithm for the Discrete Team Decision Problem, SIAM Journal on Control and Optimization, vol.45, issue.4, 2006.
DOI : 10.1137/050628374

[. Cogill, M. Rotkowitz, B. Van-roy, and S. Lall, An Approximate Dynamic Programming Approach to Decentralized Control of Stochastic Systems, Proceedings of the Forty-Second Allerton Conference on Communication, Control, and Computing, 2004.
DOI : 10.1007/11664550_13

V. Conitzer and T. Sandholm, A Generalized Strategy Eliminability Criterion And Computational Methods For Applying It, Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), 2005.

I. Chadès, B. Scherrer, and F. Charpillet, A heuristic approach for solving decentralized-POMDP, Proceedings of the 2002 ACM symposium on Applied computing , SAC '02, 2002.
DOI : 10.1145/508791.508804

G. B. Dantzig, On the Significance of Solving Linear Programming Problems with Some Integer Variables, Econometrica, vol.28, issue.1, pp.30-44, 1960.
DOI : 10.2307/1905292

J. Dickhaut and T. Kaplan, A Program for Finding Nash Equilibria, The Mathematica Journal, pp.87-93, 1991.
DOI : 10.1007/978-1-4757-2281-9_7

]. J. Doo42 and . Doob, What Is A Stochastic Process? The American Mathematical Monthly, pp.648-653, 1942.

]. W. Dor61 and . Dorn, On Lagrange Multipliers and Inequalities, Operations Research, vol.9, issue.1, pp.95-104, 1961.

G. [. Emery-montemerlo, J. Gordon, S. Schneider, and . Thrun, Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs, Proceedings of the Third International Joint Conference on Autonomous Agents and Multi Agent Systems, pp.136-143, 2004.

L. Marshall and . Fisher, The Lagrangian Relaxation Method For Solving Integer Programming Problems, Management Science, vol.27, issue.1, pp.1-18, 1981.

]. R. Fle87 and . Fletcher, Practical Methods of Optimization, 1987.

S. Govindan and R. Wilson, A global Newton method to compute Nash equilibria, Journal of Economic Theory, vol.110, issue.1, pp.65-86, 2001.
DOI : 10.1016/S0022-0531(03)00005-X

B. Hajek, Optimal control of two interacting service stations, IEEE Transactions on Automatic Control, vol.29, issue.6, pp.491-499, 1984.
DOI : 10.1109/TAC.1984.1103577

[. Hansen, D. Bernstein, and S. Zilberstein, Dynamic Programming For Partially Observable Stochastic Games, Proceedings of the Nineteenth National Conference on Artificial IntelligenceHMC00] S. Hart and A. Mas-Colell. A Simple Adaptive Procedure Leading To Correlated Equilibria, pp.709-715, 2000.

[. Klee, Combinatorial Optimization: What is the State of the Art, Mathematics of Operations Research, vol.5, issue.1, pp.1-26, 1980.
DOI : 10.1287/moor.5.1.1

D. Koller and N. Megiddo, The complexity of two-person zero-sum games in extensive form, Games and Economic Behavior, vol.4, issue.4, pp.528-552, 1992.
DOI : 10.1016/0899-8256(92)90035-Q

D. Koller and N. Megiddo, Finding mixed strategies with small supports in extensive form games, International Journal of Game Theory, vol.18, issue.1, pp.73-92, 1996.
DOI : 10.1007/BF01254386

D. Koller and B. Milch, Multi-agent influence diagrams for representing and solving games, Games and Economic Behavior, vol.45, issue.1, pp.181-221, 2003.
DOI : 10.1016/S0899-8256(02)00544-4

D. Koller and N. Megiddo, Fast algorithms for finding randomized strategies in game trees, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, pp.750-759, 1994.
DOI : 10.1145/195058.195451

D. Koller and N. Megiddo, Efficient Computation of Equilibria for Extensive Two-Person Games, Games and Economic Behavior, vol.14, issue.2, 1996.
DOI : 10.1006/game.1996.0051

D. Kreps and G. Ramey, Structural Consistency, Consistency, and Sequential Rationality, Econometrica, vol.55, issue.6, pp.1331-1348, 1987.
DOI : 10.2307/1913559

]. H. Kuh50 and . Kuhn, Extensive Games, Proceedings of the National Academy of Sciences, pp.570-576, 1950.

D. Kreps and R. Wilson, Sequential Equilibria, Econometrica, vol.50, issue.4, pp.863-894, 1982.
DOI : 10.2307/1912767

E. Daniel and . Lane, A Partially Observable Model Of Decision Making By Fishermen, Operations Research, vol.37, issue.2, pp.240-254, 1989.

E. L. Lawler, The Quadratic Assignment Problem, Management Science, vol.9, issue.4, pp.586-599, 1963.
DOI : 10.1287/mnsc.9.4.586

A. [. Land and . Doig, An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol.28, issue.3, pp.497-520, 1960.
DOI : 10.2307/1910129

J. [. Lemke and . Howson, Equilibrium Points of Bimatrix Games, Journal of the Society for Industrial and Applied Mathematics, vol.12, issue.2, pp.413-423162, 1964.
DOI : 10.1137/0112033

]. D. Lue84 and . Luenberger, Linear and Nonlinear Programming, 1984.

]. J. Mar55 and . Marschak, Elements For A Theory Of Teams, Management Science, vol.1, pp.127-137, 1955.

]. G. Mon82 and . Monahan, A Survey of Partially Observable Markov Decision Processes: Theory , Models And Algorithms, Management Science, vol.28, issue.1, pp.1-16, 1982.

]. K. Mur88 and . Murty, Linear Complementarity, Linear and Nonlinear Programming, 1988.

J. Nash, Non-Cooperative Games, The Annals of Mathematics, vol.54, issue.2, pp.286-295, 1951.
DOI : 10.2307/1969529

M. Nair, M. Tambe, D. Yokoo, S. Pynadath, and . Marsella, Taming Decentralized POMDPs: Towards Efficient Policy Computation For Multiagent Settings, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003), pp.705-711, 2003.

R. Nair, P. Varakantham, M. Tambe, and M. Yokoo, Networked Distributed POMDPs: A Synthesis Of Distributed Constraint Optimization And POMDPs, Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), 2005.

J. Martin, A. Osborne, and . Rubinstein, A Course in Game Theory, 1994.

A. Frans, . Oliehoek, T. J. Matthijs, N. Spaan, and . Vlassis, Optimal and Approximate Q-value Functions for Decentralized POMDPs, Journal of Artificial Intelligence Research, vol.32, pp.289-353, 2008.

M. James, G. W. Ooi, and . Wornell, Decentralized Control Of A Multiple Access Broadcast Channel: Performance Bounds, Proceedings of the IEEE Conference on Decision and Control, pp.293-298, 1996.

C. H. Papadimitriou, On the complexity of integer programming, Journal of the ACM, vol.28, issue.4, pp.765-768, 1980.
DOI : 10.1145/322276.322287

C. H. Papadimitriou, Computing Correlated Equilibria In Multi-Player Games, Proceedings of the 37th ACM Symposium on Theory of Computing (STOC '05), 2005.

J. [. Peterson, S. Reif, and . Azhar, Decision algorithms for multiplayer noncooperative games of incomplete information, Computers & Mathematics with Applications, vol.43, issue.1-2, pp.179-206, 2002.
DOI : 10.1016/S0898-1221(01)00282-6

H. Christos, K. Papadimitriou, and . Steiglitz, Combinatorial Optimization: Algorithms and Complexity, 1982.

C. H. Papadimitriou and J. Tsitsiklis, The Complexity of Markov Decision Processes, Mathematics of Operations Research, vol.12, issue.3, pp.441-450, 1987.
DOI : 10.1287/moor.12.3.441

D. Pynadath and M. Tambe, The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories And Models, Journal of Artificial Intelligence Research, 2002.

L. Martin and . Puterman, Markov Decision Processes, 1994.

M. Petrik and S. Zilberstein, Anytime Coordination Using Separable Bilinear Programs, Proceedings of the Twenty-Second National Conference on Artificial Intelligence, 2007.

M. Petrik and S. Zilberstein, Average-Reward Decentralized Markov Decision Processes, Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, 2007.

R. Radner, The Application of Linear Programming to Team Decision Problems, Management Science, vol.5, issue.2, pp.143-150, 1959.
DOI : 10.1287/mnsc.5.2.143

J. Reif, The complexity of two-player games of incomplete information, Journal of Computer and System Sciences, vol.29, issue.2, pp.274-310, 1984.
DOI : 10.1016/0022-0000(84)90034-5

]. I. Rom62 and . Romanovskii, Reduction Of A Game With Complete Memory To A Matrix Game, Soviet Mathematics, vol.3, pp.678-681, 1962.

Z. Rosberg, Optimal decentralized control in a multiaccess channel with partial information, IEEE Transactions on Automatic Control, vol.28, issue.2, pp.187-193, 1983.
DOI : 10.1109/TAC.1983.1103217

R. Sutton and A. Barto, Reinforcement Learning: An Introduction, IEEE Transactions on Neural Networks, vol.9, issue.5, 1998.
DOI : 10.1109/TNN.1998.712192

D. Szer and F. Charpillet, An Optimal Best-First Search Algorithm for Solving Infinite Horizon DEC-POMDPs, Proceedings of the Sixteenth European Conference on Machine Learning (ECML 2005), 2005.
DOI : 10.1007/11564096_38

URL : https://hal.archives-ouvertes.fr/inria-00000205

D. Szer and F. Charpillet, Point-based Dynamic Programming for DEC- POMDPs, Proceedings of the Twenty-First National Conference on Artificial Intelligence, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00104443

[. Szer, F. Charpillet, and S. Zilberstein, MAA*: A Heuristic Search Algorithm For Solving Decentralized POMDPs, Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI 2005), pp.576-583, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000204

[. Sandolm, A. Gilpin, and V. Conitzer, Mixed Integer Programming Methods For Finding Nash Equilibria, Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), 2005.

]. L. Sha74 and . Shapley, A Note On The Lemke Howson Algorithm, Mathematical Programming Study, vol.1, 1974.

E. [. Smallwood and . Sondik, The Optimal Control of Partially Observable Markov Processes over a Finite Horizon, Operations Research, vol.21, issue.5, pp.1071-1088, 1973.
DOI : 10.1287/opre.21.5.1071

S. Seuken and S. Zilberstein, Memory-bounded Dynamic Programming For DEC-POMDPs, Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, pp.2009-2015, 2007.

M. [. Tsitsiklis and . Athans, On the complexity of decentralized decision making and detection problems, IEEE Transactions on Automatic Control, vol.30, issue.5, pp.440-446, 1985.
DOI : 10.1109/TAC.1985.1103988

[. Varakantham, R. Nair, M. Tambe, and M. Yokoo, Winning back the CUP for distributed POMDPs, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems , AAMAS '06, 2006.
DOI : 10.1145/1160633.1160683

]. D. Whi93 and . White, A Survey Of Applications Of Markov Decision Processes, The Journal of the Operational Research Society, vol.44, issue.11, pp.1073-1096, 1993.

R. Wilson, Computing Equilibria of Two-Person Games from the Extensive Form, Management Science, vol.18, issue.7, pp.448-460, 1972.
DOI : 10.1287/mnsc.18.7.448