Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Feature Request] Additional Probabilistic Voting Methods: Conditional Utilitarian Rule and MaxParC #79

Open
mensch72 opened this issue Apr 18, 2024 · 0 comments

Comments

@mensch72
Copy link

It would be nice to have two more probabilistic methods:

Conditional Utilitarian Rule

  • Input: approval ballots.
  • Output: probability distribution.
  • A non-abstaining ballot is one that approves at least one candidate.
  • P(candidate x) = probability arising from the following random process:
    • score(candidate x) = number of approvals for x
    • Draw a ballot uniformly at random.
    • Let A be the set of candidates approved on that ballot.
    • Let M be the subset of A with largest score.
    • Draw a member of A uniformly at random.

Maximum Partial Consensus (MaxParC)

  • Input: ratings ballots (a "UtilityProfile") with ratings between 0 and 100 (inclusive)
  • Output: probability distribution.
  • Procedure:
    • Let u(i,x) be the rating ("utility") voter i assigned to candidate x.
    • Let r(i,x) = 100 if u(i,x) >= u(i,y) for all candidates y, otherwise let r(i,x) = u(i,x)
      • This ensures max{ r(i,x) : x } = 100
    • Let N be the number of voters.
    • For each x, find the smallest integer m in {0,...N} so that |{ i : r(i,x)/100 > m/N }| >= N - m. Denote this value t(x).
    • Construct an approval profile as follows:
      • i approves x iff r(i,x)/100 > m/N
    • Apply the following version of the Conditional Utilitarian Rule to this approval profile:
      • score(candidate x) = number of approvals for x + (avg. u(i,x) over all voters i) / 101
      • Draw a ballot uniformly at random.
      • Let A be the set of candidates approved on that ballot.
      • Let M be the subset of A with largest score.
      • Draw a member of A uniformly at random.

Reference: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3751225 (accepted for Soc Choice Welf)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant