Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I have a much better, simpler idea: you can't vote for the same candidate twice in the same election, period.

Another better algorithm is to have a single ballot with, say, ten blanks on it. You can fill it however you like, possibly with ten duplicates.

The blanks are weighted: the top blank carries more weight than the bottom, according to some geometric progression, like:

  1> (mapcar (op expt 0.8) (range 0 9))
  (1.0 0.8 0.64 0.512 0.4096 0.32768 0.262144 0.2097152 0.16777216
   0.134217728)
This quadratic concept requires too many tokens. If you actually want people to be able to vote for one candidate half a dozen times, you need to give them 91 tokens. But that then allows people to vote 91 times for different choices. If there aren't anywhere near that many choices, then people have tokens remaining which encourages them to vote for duplicate choices. It's just a mess where people get wrapped up in the token accounting and lose sight of the issues.


Do you really think some variant of lisp along with the op function is the best way to communicate with a wide audience? For normal people, that code is printing the result of 0.8^i for i=0..9.


I think that, well, HN comments aren't a good platform for someone looking for a wide audience.


And by wide audience, I mean people who don't program in lisp 100% of the time.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: