The following game partially captures the above strategic situation. There are n players.. Each player is asked to simultaneously choose a (real) number from the interval 0 to 100. The winner is the person whose choice is closest to 2/3 times the average of the choices of all players. The winner gets a fixed prize of $20. In case of a tie, the prize is split equally amongst those who tie.
a) Find all weakly dominated strategies.
b) Find all strategies that survive iterated elimination of weakly dominated strategies. Does it make a difference if you apply the strict or weak criterion for domination?