IE 718: Networks, Games and Algorithms

Prerequisite:  Instructor's permission

Contents

An overview of basic game theory. Co-operative and non-cooperative game theory, zero-sum and non-zero sum games, Strategy sets and equilibrium strategies; Complete and partial information models. Nash equilibrium and Bayesian Equilibrium points. Computational algorithms for equilibrium strategies.

Multi-period games: Stackelberg games, Repeated games, Dynamic games, Stochastic games. Equilibrium and related concepts.

Introductory networking games, Routing games, network formation games, games for load balancing, game theoretic view of resource allocation, and facility location problems, utility maximization in networks and game theoretic view; games for peer-to-peer systems. Some other applications of game theory like Mechanism Design (Protocol engineering), Oligopoly, Market design, etc.


References

  • M. Osborne and A. Rubenstien, A Course of Game Theory, MIT 1994.
  • J. Filar and O. Vrize, Competitive Markov Decision Processes, Springer, 1997.
  • R. Myerson, Game Theory: Analysis of Conflict, Harvard University Press, 1991.
  • D. Fudenberg and J. Tirole, Game theory, MIT Press, 1991.
  • M. Osborne, An Introduction to Game Theory, Oxford University Press, 2003.
  • R. Gibbons, Game theory for applied economists, Princeton, 1992.
  • G. Owen, Game theory, Academic Press, 1995.
  • S. Tijs, Introduction to Game theory, TRIM series, Hindustan Book Agency, 2003..
  • Mas-Colell, A. Whinston, R. and Green, J. R., Microeconomic theory. OUP, 1995.
  • T. Basar and G. J. Olsder, Dynamic and non-cooperative game theory, Classics in Applied Mathematics 23, SIAM 1999.
  • N. Nisan, T. Roughgarden, E. Tardos and V. V. Vazirani, Algorithmic Game Theory, Cambridge Univ. Press, 2007.
  • Open Literature.