A hypothetical situation. I’m not running an actual contest.
The rules are simple. You pay a dollar to play. Everybody secretly picks a number - you can pick any number you want (no hypercomplex or transfinite numbers - don’t show off). Everybody reveals their number at the same time. Whoever has the median number (which is the one that has an equal amount of other guesses that are higher and lower than it) wins the money. If there’s an even number of guesses and two medians, then the one that comes closer to the mean is the winner.
Now assuming such a game was being played, would you play and what would your strategy be? Would your startegy vary depending on the number of people playing?
I seem to recall Games Magazine ran a contest a while back where the winners were the persons whose numbers were closest to the median and mean averages. I think the mean was around 621 or so, suggesting (to me) that most people kept their guesses around 500, with a few high-guessers skewing the average up slightly.
I remember the same thing. I think the object was to guess the lowest number that nobody else guessed. Or they may have run the contest twice, once each way.
As I recall, the number range in the contest was the integers from 1 to 1,000,000 inclusive.
For the hypothetical contest in the OP, I’d simplify the situation by restricting entries to the set of positive integers.
In theory, you want to figure out what numbers everybody else would pick. But that’s difficult - how do you guess what an average person thinks is a winning numer? Or, more directly, what a group of average people think are winning numbers? And then, having hopefully figured out what the other people will guess, you have to come up with a number that will beat them. It’s a meta-guessing game like Nickel Pushing or Snakes & Diamonds.