Navigation

    Voting Theory Forum

    • Register
    • Login
    • Search
    • Recent
    • Categories
    • Tags
    • Popular
    • Users
    • Groups

    red parts of each ballot - RCV / IRV - how to find programmatically

    Single-winner
    2
    2
    203
    Loading More Posts
    • Oldest to Newest
    • Newest to Oldest
    • Most Votes
    Reply
    • Reply as topic
    Log in to reply
    This topic has been deleted. Only users with topic management privileges can see it.
    • masiarek
      masiarek last edited by masiarek

      I would like to teak an existing Python RCV tabulation program to mark all the rankings (see below in red color) that have been ignored by RCV tabulation process (these are exhausted ballots). I want to be able to demonstrate to RCV folks how quickly and many exhausted ballots/rankings are ignored / discarded.

      how to find programmatically:
      https://www.rangevoting.org/IrvIgnoreExample.html - "the red parts of each ballot are ignored by the IRV process -

      What would be the best algorithm to find the red parts?
      f0b60996-0b0c-4b9c-be57-a02436e9c32b-image.png

      I 1 Reply Last reply Reply Quote 0
      • I
        Isocratia @masiarek last edited by Isocratia

        @masiarek

        I'm fairly sure it's straightforward. Look at the final two candidates, and any candidate ranked below either of them on a voter's ballot is red.

        Edit: Also I think that example image is slightly wrong, the ballot that has D > F > B > ... should have B in black.

        1 Reply Last reply Reply Quote 0
        • First post
          Last post