Consider a modified Hotelling game, where there are players $a,a’,b,b’$, with $s_{i,\{a,a’\}} \in \{1..5\}$ and $s_{i,\{b,b’\}} \in \{5..9\}$.
The game has two rounds, where first $a$ and $a’$ compete with each other and $b$ and $b’$ compete with each other. This round is identical to the Hotelling game. Whichever player of each set has the highest payoff will advance to the next round. However, if there is any ties, then $a$ and $b$ will win in their own respective rounds. For example, if $s_a = 7$ and $s_{a’}=7$, then $a$ will advance to the second round.
The second round consists of players $a^*$ and $b^*$, which are the winners of the first round. This is the classic Hotelling game but with the players limited to their initial strategy sets. The players can not change their strategies in this round and will play the same strategies as their first round.
Question: Are there any strictly dominated strategies for $a’$?
Question: Are there any strictly dominated strategies for $a$?