MATH 210, PROBLEM SET 1
DUE IN LECTURE ON FRIDAY, JAN. 18
1. Frankfurts theory of lying and bullshit.
Read Frankfurts book On Bullshit. In particular, see the description of the distinction
he makes b
LINEAR PROGRAMMING PROBLEMS HAVE SOLUTIONS
1. Statement of the Result
Suppose n, m 1 are integers, B = (bi,j )1in,1j m is an n m matrix of positive numbers, and b = (b1 , . . . , bm ) and c = (c1 , .
ROW RANKS AND VERTICES
MATH 212 NOTES
1. Some linear algebra
The object of these notes is to simplify the problem of nding the vertices in a linear
programming problem when the matrix dening the probl
LINEAR PROGRAMMING PROBLEMS AND VERTICES
1. Statement of the Result
Suppose n, m 1 are integers, B = (bi,j )1in,1j m is an n m matrix of positive numbers, and b = (b1 , . . . , bm ) and c = (c1 , . .
MATH 212, PROBLEM SET 6
DUE FRIDAY, APRIL 5
1. Partial conflict games
In these problems, players I and II each have the option of either competing or cooperating with the other player. There are thus
MATH 212, PROBLEM SET 5
DUE MONDAY, MARCH 25
In these problems we consider the linear programming problem of nding the vectors
s = (s1 , . . . , sn ) (0, . . . , 0) for which sB (1, . . . , 1) and f (
MATH 212, PROBLEM SET 4
DUE FRIDAY, MARCH 1
Please give mathematical justications for your answers to these problems.
1. Closed sets and bounded sets
1. Let M be the subset of R2 which is the graph of
MATH 212, PROBLEM SET 3
DUE IN JONATHAN KARIVS MAILBOX IN THE MATH OFFICE BY 5 P.M. ON WEDNESDAY, FEB. 13.
A multi-option two-person game.
The object of this set of exercises is to nd the optimal stra
MATH 212, PROBLEM SET 2
DUE IN LECTURE ON MONDAY, FEBRUARY 4.
A three option two person zero sum game.
The rock-paper-scissors game has two players who simultaneously choose between three
options; roc
The Effectiveness of Tit-for-Tat
Miguel Dvila
Josh Jackson
Sung-Ho Park
Introduction
The Prisoners Dilemma, a simple game in which two players have the choice
between either cooperating or defecting,