All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Games
Prisoner's Dilemma (Posted on 2005-10-06) Difficulty: 3 of 5
Two people in a greed therapy group are playing a game. There is a pot of 6 dollars and each person, while isolated, is asked the question "Do you want to be greedy and take all of it?" The money goes to the person who is greedy and if they answer the same they share it. To punish their greed, a player must pay 1 dollar of what he won if he were greedy and an extra dollar if both players were greedy.

You \ Other | Not Greedy | Greedy |
Not Greedy  |     3\3    |   0\5  |
Greedy      |     5\0    |   1\1  |
A) Which option should you choose the first time you play?

B) If you continue playing an unknown finite number of games, what strategy should you use to maximize the amount of money you can win? (Assume that your opponent doesn't necessarily use the same strategy as you.)

Note: Both players are trying to get as much money as possible, and neither needs to get a certain amount of money at all costs.

No Solution Yet Submitted by Gamer    
Rating: 3.0000 (5 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
StrategyYuval2006-06-17 09:29:29
SolutionElaboration on earlier solution set.Jack Lim2006-03-02 08:25:53
Best wayJack Lim2006-03-02 08:08:36
an answersaprom2005-12-21 13:44:33
SolutionNo Subjectwastoids2005-12-20 23:06:59
Solutionsolutionwastoids2005-12-20 22:53:06
re:Gamer2005-10-07 02:18:00
Some Thoughtsstrategy analysisTristan2005-10-07 01:40:21
Some ThoughtsMy ideaFederico Kereki2005-10-06 22:34:12
Some Thoughtsat least halfchris2005-10-06 21:26:51
Some ThoughtsGreed (is | is not) goodBob Smith2005-10-06 18:33:56
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information