Weiß jemand wie löst diese Aufgabe? [Guessing Game (if a draw occurs, the player with the smallest index i wins the toss)]
In a guessing game with p=1/2. We have n players. Each player i has to choose a number x_i between 0 and 100, winner is the one closest to p times the average. If a draw occurs the player with the smallest index i wins the toss.
a) Define level-0, level-1, level-2 and level-3.
b) Is (0,....,0) a Nash-Equilibrium?
c) Is 0 a dominant strategy?
d) Is (0,....,0) the unique Nash-Equilibrium?