Honestly, this entire post reads like a fever dream.
You don't need the n bits of information from each ballot. You can just transmit the aggregate counts. A human can easily put tally marks in each of n buckets. In fact, a computer would likely do the same instead of…
Do you have something US-specific to indicate that this would be the case? Neither empirics nor theory support your claim. https://rangevoting.org/TarrIrvSumm.html
Nope! This is a problem with high-cardinality ordinal voting methods. Since factorial is a very fast growing function, you can easily encode a pattern in down-ballot candidates and buy and verify a specific ballot.…
I'd go as far as to say Approval > FPTP > IRV. FPTP has good properties like monotonicity (for a good example see http://zesty.ca/voting/sim/), easily distributed counting, and preservation of the secret ballot that IRV…
Honestly IRV is _even worse than plurality_. It doesn't solve the problems it sets out to solve (it entrenches two-party domination [1]), it has ridiculous monotonicity violations [2], all for a lot more complication in…
If you accidentally write "return x = 1" when x is a variable, you always return true. If you return "1 = x", you cause a syntax error. So some people have gotten into the habit of writing constants on the left, even if…
This is essentially equivalent to feeding the input through bitwise-NOT first. Unfortunately, there are far more integers that are neither sparse nor dense than integers that are sparse or dense.
> since submissions should link to english content in the first place I don't think this is the case. I certainly don't see anything like that in the [guidelines](https://news.ycombinator.com/newsguidelines.html)
I had $200k+ TC new grad offers from FAANGs in 2013, and one of them wasn't even for a role in the Bay Area. It's not a stark contrast at all. The market has been consistently willing to pay strongly for new talent.
Honestly, this entire post reads like a fever dream.
You don't need the n bits of information from each ballot. You can just transmit the aggregate counts. A human can easily put tally marks in each of n buckets. In fact, a computer would likely do the same instead of…
Do you have something US-specific to indicate that this would be the case? Neither empirics nor theory support your claim. https://rangevoting.org/TarrIrvSumm.html
Nope! This is a problem with high-cardinality ordinal voting methods. Since factorial is a very fast growing function, you can easily encode a pattern in down-ballot candidates and buy and verify a specific ballot.…
I'd go as far as to say Approval > FPTP > IRV. FPTP has good properties like monotonicity (for a good example see http://zesty.ca/voting/sim/), easily distributed counting, and preservation of the secret ballot that IRV…
Honestly IRV is _even worse than plurality_. It doesn't solve the problems it sets out to solve (it entrenches two-party domination [1]), it has ridiculous monotonicity violations [2], all for a lot more complication in…
If you accidentally write "return x = 1" when x is a variable, you always return true. If you return "1 = x", you cause a syntax error. So some people have gotten into the habit of writing constants on the left, even if…
This is essentially equivalent to feeding the input through bitwise-NOT first. Unfortunately, there are far more integers that are neither sparse nor dense than integers that are sparse or dense.
> since submissions should link to english content in the first place I don't think this is the case. I certainly don't see anything like that in the [guidelines](https://news.ycombinator.com/newsguidelines.html)
I had $200k+ TC new grad offers from FAANGs in 2013, and one of them wasn't even for a role in the Bay Area. It's not a stark contrast at all. The market has been consistently willing to pay strongly for new talent.