Professional Documents
Culture Documents
Game Theory and Its Application
Game Theory and Its Application
*
* Strategic decisions making by intelligent rational thinkers * Helps decision making under uncertainty * Taking your best decision considering the rivals best move
Not Applicable to * Games of pure chance, e.g. lotteries, slot machines. (Strategies don't matter). * Games without strategic interaction between players
*
* Two Prisoners, Ramesh & Suresh * Each prisoner has two possible actions. * Prisoners choose actions simultaneously without knowing the
action chosen by the other. * Consequences quantified in prison years.
* If neither confesses, each gets 1 year * If both confess, each gets 5 years * If 1 confesses, he goes free and other gets 15 years
*
We have your friend Ramesh and he is starting to talk
*
Ramesh Confess Dont Confess
Suresh
Confess
( -5,
-5)
( 0, -15)
Dont Confess
( -15, 0)
( -1, -1)
*
Nash Equilibrium
Neither player has an incentive to change strategy, given the other players choice
*
Conclusion: The Suresh will confess
And Ramesh?
*
Ramesh Confess Dont Confess
Suresh
Confess
( -5,
-5)
( 0, -15)
Dont Confess
( -15, 0)
( -1, -1)
*
Conclusion: Ramesh confesses also Best Decisions of both strategic players Dont even get the 2nd best Both get 5 years, even though if they cooperated, they could get off with one year each
For both, confession is a dominant strategy: a strategy that yields a better outcome regardless of the opponents choice
*
What would the Ramesh and Suresh decide if they could negotiate? They could both become better off if they reached the cooperative solution.
which is why police interrogate suspects in separate rooms.
Tit for Tat Tit for Two Tat Suspicious Tit for Tat Free Rider Always Cooperate
Axelrods Tournament
Tit for Tat Tit for Two Tat Suspicious Tit for Tat Free Rider Always Cooperate
Axelrods Tournament
* Nice; it cooperates on the first move. * Regulatory; it punishes defection with defection. * Forgiving; it continues cooperation after cooperation
by the opponent.
* Cooperate on the first two moves. * If the opponent defects twice in a row, choose defection
* Always defect on the first move. * Thereafter, replicate opponents last move. * Key Points of Suspicious Tit for Tat
* If the opponents first move is defection, this
* The first move is inconsequential compared to
getting stuck in an infinite defection loop.
strategy outperforms Tit for Tat * However, it is generally worse than Tit for Tat.
*Took place in the early 1980s *Professional game theorists were invited by Axelrod
to submit their own programs for playing the iterative Prisoners Dilemma. *Each strategy played every other, a clone of itself, and a strategy that cooperated and defected at random hundreds of times
*Tit for Tat won the first Tournament. *Moreover, Tit for Tat won a second tournament where
all 63 entries had been given the results of the first tournament.