Achieving Pareto optimality through distributed learning

SIAM Journal on Control and Optimization

Volumn 52, Issue 5, 2014, Pages 2753-2770

  Marden, Jason R ^a   Young, H Peyton ^b   Pao, Lucy Y ^b,c  

^a UCB 450   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Cooperative control; Game theory; Learning in games

Indexed keywords

COMPLEX NETWORKS; ELECTRIC UTILITIES; GAME THEORY; MARKOV PROCESSES; PARETO PRINCIPLE; STOCHASTIC SYSTEMS; WIND POWER;

CO-OPERATIVE CONTROL; DESIGN AND CONTROL; DISTRIBUTED COMPONENTS; DISTRIBUTED LEARNING; LARGE DEVIATIONS; LEARNING IN GAMES; LEARNING RULES; PARETO-OPTIMALITY;

ALGORITHMS;

EID: 84911010727     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/110850694     Document Type: Article

References (45)

1. I. Androulakis and G. Reklaitis, Approaches to asynchronous decentralized decision making, Comput. Chemical Engrg., 23 (1999), pp. 339-354.
2. I. Arieli and Y. Babichenko, Average Testing and the Efficient Boundary, Discussion paper, Department of Economics, University of Oxford and Hebrew University, 2011.
3. G. Arslan, J. R. Marden, and J. S. Shamma, Autonomous vehicle-target assignment: A game theoretical formulation, ASME J. Dynam. Systems Measurement Control, 129 (2007), pp. 584-596.
4. D. Blatt, A. O. Hero, and H. Gauchman, A convergent incremental gradient method with a constant step size, SIAM J. Optim., 18 (2008), pp. 29-51.
5. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers, Found. Trends Machine Learning, 3 (2010), pp. 1-122.
6. G. C. Chasparis and J. S. Shamma, Distributed Dynamic Reinforcement of Efficient Outcomes in Multiagent Coordination and Network Formation, Discussion paper, Department of Electrical Engineering, Georgia Tech, 2011.
7. H. B. Durr, M. S. Stankovic, and K. H. Johansson, Distributed positioning of autonomous mobile sensors with application to coverage control, in Proceedings of the American Control Conference, 2011.
8. D. P. Foster and H. P. Young, Stochastic evolutionary game dynamics, J. Theoret. Population Biol., 38 (1990), pp. 219-232.
9. D. P. Foster and H. P. Young, Regret testing: Learning to play Nash equilibrium without knowing you have an opponent, Theoretical Economics, 1 (2006), pp. 341-367.
10. P. Frihauf, M. Krstic, and T. Basar, Nash equilibrium seeking for games with non-quadratic payoffs, in Proceedings of the IEEE Conference on Decision and Control, 2010.
11. P. Frihauf, M. Krstic, and T. Basar, Nash equilibrium seeking with infinitely-many players, in Proceedings of the American Control Conference, 2011.
12. D. Fudenberg and E. Maskin, The folk theorem in repeated games with discounting or with incomplete information, Econometrica, 54 (1986), pp. 533-554.
13. R. Gopalakrishnan, J. R. Marden, and A.Wierman, An architectural view of game theoretic control, ACM SIGMETRICS Performance Evaluation Review, 38 (2011), pp. 31-36.
14. S. Hart and A. Mas-Colell, Uncoupled dynamics do not lead to Nash equilibrium, American Economic Review, 93 (2003), pp. 1830-1836.
15. S. Hart and A. Mas-Colell, Stochastic uncoupled dynamics and Nash equilibrium, Games Econom. Behav., 57 (2006), pp. 286-303.
16. Y. Hatano and M. Mesbahi, Agreement over random networks, IEEE Trans. Automat. Control, 50 (2005), pp. 1867-1872.
17. A. Jadbabaie, J. Lin, and A. S. Morse, Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Trans. Automat. Control, 48 (2003), pp. 988-1001.
18. R. Johari, The price of anarchy and the design of scalable resource allocation mechanisms, in Algorithmic Game Theory, N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani, eds., Cambridge University Press, Cambridge, UK, 2007.
19. K. E. Johnson and N. Thomas, Wind farm control: Addressing the aerodynamic interaction among wind turbines, in Proceedings of the American Control Conference, 2009.
20. R. S. Komali and A. B. MacKenzie, Distributed topology control in ad-hoc networks: A game theoretic perspective, in Proceedings of the IEEE Consumer Communications and Network Conference, 2007.
21. th IFAC Symposium on Nonlinear Control Systems, 2010.
22. N. Li and J. R. Marden, Decoupling Coupled Constraints Through Utility Design, Discussion paper, IEEE Tran. Automat. Control, 59 (2014), pp. 2289-2294.
23. N. Li and J. R. Marden, Designing games for distributed optimization, IEEE J. Selected Topics in Signal Processing, 7 (2013), pp. 230-242.
24. I. Lobel and A. Ozdaglar, Distributed subgradient methods for convex optimization over random networks, IEEE Trans. Automat. Control, 56 (2011), pp. 1291-1306.
25. J. R. Marden, State based potential games, Automatica, 48 (2012), pp. 3075-3088.
26. J. R. Marden, G. Arslan, and J. S. Shamma, Connections between cooperative control and potential games, IEEE Trans. Systems Man Cybernetics B, 39 (2009), pp. 1393-1407.
27. J. R. Marden, G. Arslan, and J. S. Shamma, Joint strategy fictitious play with inertia for potential games, IEEE Trans. Automat. Control, 54 (2009), pp. 208-220.
28. J. R. Marden, S. D. Ruben, and L. Y. Pao, A model-free approach to wind farm control using game theoretic methods, IEEE Trans. Control Systems Technology, 21 (2013), pp. 1207-1214.
29. J. R. Marden, H. P. Young, G. Arslan, and J. S. Shamma, Payoff based dynamics for multi-player weakly acyclic games, SIAM J. Control Optim., 48 (2009), pp. 373-396.
30. st IEEE Conference on Decision and Control, 2012.
31. D. Monderer and L. S. Shapley, Potential games, Games Econom. Behav., 14 (1996), pp. 124-143.
32. A. Nedic, A. Olshevsky, A. Ozdaglar, and J. N. Tsitsiklis, On distributed averaging algorithms and quantization effects, IEEE Trans. Automat. Control, 54 (2009), pp. 2506-2517.
33. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Algorithmic Game Theory, Cambridge University Press, New York, 2007.
34. M. J. Osborne and A. Rubinstein, A Course in Game Theory, MIT Press, Cambridge, MA, 1994.
35. B. R. Pradelski and H. P. Young, Learning Efficient Nash Equilibria in Distributed Systems, Discussion paper, Department of Economics, University of Oxford, Oxford, UK, 2010.
36. M. V. Solodov, Incremental gradient algorithms with stepsizes bounded away from zero, Comput. Optim. Appl., 11 (1998), pp. 23-35.
37. M. S. Stankovic, K. H. Johansson, and D. M. Stipanovic, Distributed seeking of Nash equilibria in mobile sensor networks, in Proceedings of the IEEE Conference on Decision and Control, 2010.
38. J. Tsitsiklis and M. Athans, Convergence and asymptotic agreement in distributed decision problems, IEEE Trans. Automat. Control, 29 (1984), pp. 42-50.
39. J. Tsitsiklis, D. Bertsekas, and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE Trans. Automat. Control, 31 (1986), pp. 803-812.
40. D. Wolpert and K. Tumor, An overview of collective intelligence, in Handbook of Agent Technology, J. M. Bradshaw, ed., AAAI Press/MIT Press, 1999.
41. H. P. Young, The evolution of conventions, Econometrica, 61 (1993), pp. 57-84.
42. H. P. Young, Learning by trial and error, Games Econom. Behav., 65 (2009), pp. 626-643.
43. M. Zhu and S. Martinez, Distributed coverage games for energy-aware mobile sensor networks, SIAM J. Control Optim. 51 (2010), pp. 1-27.
44. M. Zhu and S. Martinez, On Distributed Convex Optimization Under Inequality and Equality Constraints via Primal-Dual Subgradient Methods, preprint, arXiv:1001.2612, 2010.
45. Q. Zhu, H. Tembine, and T. Basar, Heterogeneous learning in zero-sum stochastic games with incomplete information, in Proceedings of the IEEE Conference on Decision and Control, 2010.