Problem_Set_1 - 2.12, Number 16, but these other answers...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
OR4350 Introduction to Game Theory Spring 2010 Problem Set #1 Due : Wednesday, February 10, 2010 at noon in the dropbox (on 2 nd floor of Rhodes Hall) Reminder : Write your Section and NetID on the first page of your homework!!! Answers must always include complete explanations/justifications. 1. Binmore, Section 2.12, Number 1(a)-(e) and 6. 2. Give a strategy stealing argument to show that if the second player to move in Tic-Tac-Toe has a winning strategy, then so also must the first player have a winning strategy. (Then also look at the rest of the question, Binmore, Section
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2.12, Number 16, but these other answers you should not submit as part of your solutions.) 3. Binmore, Section 2.12, Number 26. 4. Peres, Game Theory, Alive , from http://www.stat.berkeley.edu/~peres/gtlect.pdf page 47, Number 2.15. To specify a winning strategy you must give the next move from any possible configuration that the board might be in. In addition, explain which player can assure a win from the starting position specified in the question....
View Full Document

Ask a homework question - tutors are online