Announcement:

• course annoucement
• previous version
• Course text: A Course in Game Theory by Martin J. Osborne, Ariel Rubinstein.

• Exercises 18.2 (done in class), 18.3, 18.5, 19.1.
  Due: Monday, 31 Jan.
• Exercises 27.2 (done in class), 28.1, 28.2.
  Due: Wed 16 Feb
• Exercises 35.1, 35.2, 36.1, 36.2.
  Due: Wed 10 Mar
• Exercises 259.3, 260.2, 261.1, 261.3.
  Due: ends of classes.

Readings

• Interdependent Security, H. Kunreuther, G. Heal.
• Algorithms for Interdependent Security Games, M. Kearns, L. Ortiz.
• Why Information Security is Hard --- An Economic Perspective Anderson.
• The Economics of Censorship Resistance Danezis and Anderson.
• System Reliability and Free Riding Varian.

Other reading

• Truth and Probablity, by Frank Ramsey (1926). A rebuttal to Keysian view on probability.
• Preplay contracting in Prisoners Dilemma, by Hal Varian
• Playing Large Games Using Simple Strategies, R. Lipton, E. Markakis, A. Mehta.
• Competitive Autions and Digital Goods, A. Goldberg, J. Hartline, A. Wright.
• Competitive Auctions Goldberg, Hartline and Karlin.
• A modest proposal for prevents Internet congestion, A. Odlyzko.
• Algorithms for Selfish Agents, N. Nisan.
• Vote Pair, strategic voting.
• STV voting paper