Price and variance of anarchy in mean-variance cost density-shaping stochastic differential games

This paper introduces the Variance of Anarchy (VoA) metric to compliment existing measures of efficiency loss in dynamic games due to decentralized mechanisms. The VoA is inspired by Price of Anarchy (PoA) and Price of Information (PoI) measures that have been used previously in the literature. We propose a new design procedure for decentralized control algorithms using PoA and VoA that identifies the optimal control solution for competing agents among a family of decentralized controllers by solving an optimization of a summed PoA and VoA objective function over a parameter space. The design method is illustrated with a stochastic model for queue server dynamics and two separate optimal control problems - the first involving noncooperative agents, and the second a team. For each problem, a family of density-shaping cumulant controls is computed corresponding to a parametric target cumulant set, and the optimal chosen via this new procedure. Simulation results are provided to compare the controller to a baseline 2CC control.

[1]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[2]  Shuchi Chawla,et al.  Bayesian algorithmic mechanism design , 2014, SECO.

[4]  Quanyan Zhu,et al.  Price of anarchy and price of information in N-person linear-quadratic differential games , 2010, Proceedings of the 2010 American Control Conference.

[5]  Renato Paes Leme,et al.  Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[6]  Eitan Altman,et al.  Multiuser rate-based flow control , 1998, IEEE Trans. Commun..

[7]  Matthew J. Zyskowski.  Cost density-shaping for stochastic optimal control , 2010 .

[8]  T. Roughgarden,et al.  Algorithmic Game Theory: Introduction to the Inefficiency of Equilibria , 2007 .

[9]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[10]  Quanyan Zhu,et al.  Secure routing in smart grids , 2011 .

[11]  Matthew Zyskowski,et al.  Multiplayer nash solution for noncooperative cost density-shaping games , 2011, Proceedings of the 2011 American Control Conference.

[12]  Quanyan Zhu,et al.  A trade-off study between efficiency and fairness in communication networks , 2008, IEEE INFOCOM Workshops 2008.

[13]  Quanyan Zhu,et al.  Prices of Anarchy, Information, and Cooperation in Differential Games , 2011, Dyn. Games Appl..

[14]  Allan Borodin,et al.  Price of anarchy for greedy auctions , 2009, SODA '10.

[15]  S. Liberty,et al.  Multi-Cumulant and Pareto Solutions for Tactics Change Prediction and Performance Analysis in Stochastic Multi-Team Noncooperative Games , 2008 .