BUS 221 Lecture Notes - Lecture 11: Dont
6 Feb 2016
School
Department
Course
Professor
Document Summary
We can"t model this kind of game using a matrix of square because it. Player 1 can be fair (offer half) or greedy (offer ) of . Other possible outcomes: to get help, without helping! (highest utility = 3, to help, without being helped! (lowest utility = 0, both help each other (utility = 2) August: neither helps (utility = 1) (in. The neighbours need to find a way to trust each other because: They are being short sided if they think otherwise. There is more profit to be gained. They are going to live side-by-side for years. Be less trusting next year: or, try helping again to send a signal. And maybe farmer 2 takes the hint, and starts cooperating. The lesson: it can pay to be nice if there is a future! The farmer"s problem is a lot like the prisoner"s dilemma. It is the basic version of the sequential pd.
