English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Several election districts in the US have recently moved to ranked-choicevoting (RCV) to decide the results of local elections. RCV allows voters torank their choices, and the results are computed in rounds, eliminating onecandidate at a time. RCV ensures fairer elections and has been shown toincrease elected representation of women and people of color. A main drawbackof RCV is that the round-by-round process requires all the ballots to betallied before the results of an election can be calculated. With increasinglylarge portions of ballots coming from absentee voters, RCV election outcomesare not always apparent on election night, and can take several weeks to bepublished, leading to a loss of trust in the electoral process from the public.In this paper, we present an algorithm for efficiently computing possiblewinners of RCV elections from partially known ballots and evaluate it on datafrom the recent New York City Primary elections. We show that our techniquesallow to significantly narrow down the field of possible election winners, andin some case identify the winner as soon as election night despite a number ofyet-unaccounted absentee ballots, providing more transparency in the electoralprocess.

Identifying Possible Winners in Ranked Choice Voting Elections with Outstanding Ballots