Timeline for The Worst Possible Winner
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 12, 2010 at 15:37 | vote | accept | Mark Bell | ||
| Jul 12, 2010 at 3:32 | comment | added | Alexander Woo | Assuming the number of races is a multiple of $p-1$ or large enough to avoid issues with lack of solutions to linear diophantine equations, the answer is the smallest $x$ with $f(x)$ bigger than the average score. (Everyone else takes the other $p-1$ places exactly once.) | |
| Jul 12, 2010 at 1:12 | answer | added | Doug Chatham | timeline score: 14 | |
| Jul 12, 2010 at 0:14 | comment | added | Doug Chatham | This seems to be a voting problem in disguise. The racers are the alternatives being voted on, the results of each race is an individual's preference profile, and your scoring function $f$ is a positional voting method. (See for example the Borda Count page of Wikipedia (en.wikipedia.org/wiki/Borda_count ). I don't have an answer to your question yet, but I suspect the best position of your winning racer can be low. | |
| Jul 11, 2010 at 22:59 | history | asked | Mark Bell | CC BY-SA 2.5 |