Topics created by BTernaryTau

@SaraWolk @Jameson-Quinn Thank you for responding. I've emailed Sara about next steps, and I hope to hear back from you soon.

You are def not the first one to ask this: https://link.springer.com/content/pdf/10.1007/s003550100128.pdf Here they give a few examples that participation does not imply monotonicity.

@bternarytau Pretty sure it was that the average was not theoretically motivated

@bternarytau

This is a little nitpicky, but the notation

P(f(k, e) = c)

implies that k is random (because if k is fixed, then this probability would have to be either 0 or 1), but this is not stated.

Assuming that there are finite possible seeds and that each seed is equally likely to be chosen, we could write:
P(f(k, e) = c) = sum over s in S (I_c(f(s, e)))/|S|,
where S is the set of seeds, I_c(f(s, e)) = 1 if f(s, e) = c and I_c(f(s, e)) = 0 otherwise.

For many methods, |S| might need to be chosen in a way that depends on some limited information about the election, in particular the number of candidates (since for there to be an even 3-way tiebreaker, |S| needs to be divisible by 3 and so on). Methods that are "routinely" non-deterministic (such as random ballot) might also require the number of votes to select |S|.