Skip to main content
Log in

Prices of Anarchy, Information, and Cooperation in Differential Games

  • Published:
Dynamic Games and Applications Aims and scope Submit manuscript

Abstract

The price of anarchy (PoA) has been widely used in static games to quantify the loss of efficiency due to noncooperation. Here, we extend this concept to a general differential games framework. In addition, we introduce the price of information (PoI) to characterize comparative game performances under different information structures, as well as the price of cooperation to capture the extent of benefit or loss a player accrues as a result of altruistic behavior. We further characterize PoA and PoI for a class of scalar linear quadratic differential games under open-loop and closed-loop feedback information structures. We also obtain some explicit bounds on these indices in a large population regime.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alpcan T, Başar T, Srikant R, Altman E (2002) CDMA uplink power control as noncooperative game. Wirel Netw 8:659–690

    Article  MATH  Google Scholar 

  2. Altman E, Başar T (1998) Multiuser rate-based flow control. IEEE Trans Commun 46(7):940–949

    Article  Google Scholar 

  3. Altman E, Boulogne T, El-Azouzi R, Jimnez T, Wynter L (2006) A survey on networking games in telecommunications. Comput Oper Res 33(2):286–311

    Article  MATH  MathSciNet  Google Scholar 

  4. Azad AP, Altman E, El-Azouzi R (2010) Routing games: From egoism to altruism. In: Proc 8th international symp modeling and optimization in mobile, ad hoc, and wireless networks (WiOpt 2010), Workshop WNC3 2010, Avignon, France, May 31–June 4, 2010, pp 442–451

  5. Başar T (1972) A contradictory property of the Nash solution for two stochastic nonzero-sum games. In: Proc 10th Allerton conf on circuit and system theory, October 1972, pp 819–827

  6. Başar T (1989) Time consistency and robustness of equilibria in noncooperative dynamic games. In: Van der Ploeg F, de Zeeuw A (eds) Dynamic policy games in economics. North-Holland, Amsterdam, pp 9–54

    Google Scholar 

  7. Başar T (2007) Control and game-theoretic tools for communication networks (Overview). Appl Comput Math 6(2):104–125

    MathSciNet  Google Scholar 

  8. Başar T, Ho YC (1974) Informational properties of the Nash solutions of two stochastic nonzero-sum games. J Econ Theory 7(4):370–387

    Google Scholar 

  9. Başar T, Olsder GJ (1999) Dynamic noncooperative game theory, 2nd edn. SIAM series in classics in applied math. SIAM, Philadelphia

    MATH  Google Scholar 

  10. Dockner E, Jorgensen S, Long NV, Sorger G (2006) Differential games in economics and management science. Cambridge University Press, Cambridge

    Google Scholar 

  11. Dubey P (1986) Inefficiency of Nash equilibria. Math Oper Res 11(1)

  12. Engwerda JC (2000) Feedback Nash equilibria in the scalar infinite horizon LQ-game. Automatica 36:135–739

    Article  MATH  MathSciNet  Google Scholar 

  13. Engwerda JC (2000) The solution set of the N-player scalar feedback Nash algebraic Riccati equations. IEEE Trans Autom Control 48:847–853

    Article  MathSciNet  Google Scholar 

  14. Engwerda JC (2005) LQ dynamic optimization and differential games. Wiley, New York

    Google Scholar 

  15. Grossklags J, Johnson B, Christin N (2009) The price of uncertainty in security games. In: Proc eighth workshop on the economics of information security (WEIS)

  16. Johari R, Mannor S, Tsitsiklis J (2005) Efficiency loss in a network resource allocation game: The case of elastic supply. IEEE Trans Autom Control 50(11):1712–1724

    Article  MathSciNet  Google Scholar 

  17. Johari R, Tsitsiklis J (2004) Network resource allocation and a congestion game: The single link case. In: Proc 42nd IEEE conf decision and control (CDC), December 2004, pp 2112–2117

  18. Maheswaran RT, Başar T (2003) Nash equilibrium and decentralized negotiation in auctioning divisible resources. J Group Decis Negot (GDN) 13

  19. Roughgarden T, Tardos E (2004) Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econ Behav 47:389–403

    Article  MATH  MathSciNet  Google Scholar 

  20. Shakkottai S, Srikant R, Ozdaglar A, Acemoglu D (2008) The price of simplicity. IEEE J Sel Areas Commun, Game Theory Commun Syst 26(7)

  21. Zhu Q, Başar T (2010) Price of anarchy and price of information in N-person linear-quadratic differential games. In: Proc American control conf (ACC), Baltimore, Maryland, June 2010

  22. Zhu Q, Pavel L (2008) Stackelberg game approach in OSNR optimization of optical networks with capacity constraints. In: Proc American control conf (ACC), pp 762–767

  23. Zhu Q, Pavel L (2008) State-space approach to pricing design in OSNR Nash games. In: Proc IFAC congress, Seoul, Korea, 2008

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tamer Başar.

Additional information

Research supported in part by grants from AFOSR and DOE.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Başar, T., Zhu, Q. Prices of Anarchy, Information, and Cooperation in Differential Games. Dyn Games Appl 1, 50–73 (2011). https://doi.org/10.1007/s13235-010-0002-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13235-010-0002-3

Keywords

Navigation