The Pirates' Game (part II) – Solution
The solution to the challenge published a few days ago can be found here. Wikipedia provides more details on the allocation.
The intersting learning from this game is that to come up with the ideal solution, the proposing pirate needs to think in terms of the other
pirates (want would they need to accept this deal) instead of focusing on his perspective and as such, the optimal allocation is:
A: 98 coins
B: 0 coins
C: 1 coin
D: 0 coins
E: 1 coin[1]
- A: 98 coins
- B: 0 coins
- C: 1 coin
- D: 0 coins
- E: 1 coin
You might be interested in these related posts:
- The Prisoner's Dilemma: Applying Game Theory to Agile Contracting At Isabelle’s request, I agreed to attend Simon Bennett’s session...
- Can you use Agile development for BI projects? I wanted to summarize Tuesday morning’s session at the TDWI BI Executive...
- The 7 Dimensions of an Agile Project Team In my quest to better define what Agile Leadership is...
- Timmy's story: Is it better to be right or to be helpful? This is the story of Timmy, a highly talented university...
- Happy 1st anniversary Analytical-Mind It has already been 1 year since I published my...
Categories: Conferences, Management, agile 2009 Agile2009, Conferences, Pirate's Game, Pyxis, Team Dynamic

