Re: help on strategy for a game????

In article <[EMAIL PROTECTED]>, Parth wrote:
> the game is as follows: 
> 
>                  Agent 2
> 
>                 C       D
>              ________________
>             |       |       |
>           C | 3, 3  |  1, 5 |
>             |_______|_______|
> Agent 1     |       |       |
>           D | 5, 1  |  0, 0 |
>             | ______|_______|
> 
> 
> The game is to be played 1000 times against another agent... No fixed
> strategy seems to work against all other fixed stategies... suggest
> some cooperative mixed strategy for this game please.

There is something missing from your description. If it is just a contest
between two agents to see who has the best total after 1000 matches, then
the optimal strategy is for each player to use a pure strategy of choosing
D.

Only if there are multiple players or if each player cares only about their
score is there an interesting problem.