Player I chooses a positive integer x > 0 and player II chooses a positive integer y > 0. The player with the lower number pays a dollar to the player with the higher number unless the higher number is more than twice larger in which case the payments are reversed. if y < x < 2y or x < y/2, if x < y < 2x or y < x/2, A(x, y) = -1 0 if x = y. Find the unique optimal strategy in this game.