拉斯穆森的《博弈与信息》 习题答案 (奇数题).pdfVIP

ODD Answers to Odd-Numbered Problems, 4th Edition of Games and Information, Rasmusen PROBLEMS FOR CHAPTER 1 26 March 2005. 12 September 2006. Erasmuse@. Http://. This appendix contains answers to the odd-numbered problems in the gourth edition of Games and Information by Eric Rasmusen, which I am working on now and perhaps will come out in 2005. The answers to the even- numbered problems are available to instructors or self-studiers on request to me at Erasmuse@. Other books which contain exercises with answers include Bierman Fernandez (1993), Binmore (1992), Fudenberg Tirole (1991a), J. Hirshleifer Riley (1992), Moulin (1986), and Gintis (2000). I must ask pardon of any authors from whom I have borrowed without attribution in the problems below; these are the descendants of problems that I wrote for teaching without careful attention to my sources. 100 PROBLEMS FOR CHAPTER 1 1.1. Nash and Iterated Dominance (medium) (a) Show that every iterated dominance equilibrium s∗ is Nash. Answer. Suppose that s∗ is not Nash. This means that there existS some i and s i ∗ ∗ such that i could profitably deviate, i.e., π (s ) π (s , s ). But that means that i i i −i there is no point during the iterated deletion at which player i could have eliminated ∗ strategy s as being even weakly dominated for him by s . Hence