Problem:
Write down an integer from to inclusive. This problem will be scored as follows: if is the second-largest number from among the responses submitted, then each team that submits gets points, and everyone else gets zero. (If every team picks the same number then nobody gets any points.)
Solution
Solution:
The only Nash equilibria of this game (where each team plays its best possible move given the other teams' choices) are fairly degenerate: every team but one plays , and the remaining team is more likely to choose than any higher number. Of course, we cannot assume perfectly rational play in reality - nor are the utility functions the same, since the goal is to score higher than other teams, not to maximize one's own expected number of points. It will be interesting to see what the submissions are.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.