MA 440-001
Game Theory
Mathematics
Homework
Assigned Aug. 22
Click here. Turn in Friday, Aug. 29.
Assigned Aug. 29 (corrected Sept. 3)
Click here. Turn in Friday, Sept. 5.
Assigned Sept. 5
Click here. Turn in Friday, Sept. 12.
Assigned Sept. 12 and 15
Click here. Turn in Friday, Sept. 19.
Assigned Sept. 19
Problem 2.4a. Do not turn in. Answer: (63, 31).
Problem 2.15a, b. Do not turn in. Answer to a is in text (p. 397). Answer to b is nyy.
Problem 2.15c. The first legislator has two strategies, the second has four, the third has sixteen. To do the problem, assume that the third legislator uses the suggested strategy. Draw a 2 by 4 table that shows the payoffs to the first two legislators from each of their possible strategy choices, assuming the third legislator uses the suggested strategy. Find strategies for the first two legislators that make a Nash equilibrium for them, assuming the third legislator uses the suggested strategy. Once you've found strategies for the first two, argue that the third legislator cannot improve his own payoff by changing to one of his other strategies.
Problem 3.7: Show that there are no Nash equilibria in which q_1 + q_2 + q_3 < 975,00, exactly one q_i equals 600,000, and the other q_i's are strictly between 0 and 600,000.
Turn in 2.15c and 3.7 on Wednesday, Sept. 24.
Assigned Oct. 3, revised Oct. 8
Click here. Turn in Friday, Oct. 17.
Assigned Oct. 17
Click here. Turn in Friday, October 24.
Assigned Oct. 24, revised Oct. 27
Click here. Turn in Friday, October 31.
Assigned Nov. 5
Problems 7.5 and 7.12d in Gintis. Turn in Wednesday, November 12.
Assigned Nov. 21, revised Dec. 1
Click here. Turn in Friday, December 5.
MA 440-001 home page | Notes on game theory
Text and schedule |
Course policies
Hints and answers
Test study guides |
Grade Book | Resources
Instructor's home page
Last modified Mon Dec 1 2008
Send questions or comments to schecter@math.ncsu.edu