Single non-transferable vote or SNTV is an electoral system used to elect multiple winners. It is a generalization of first-past-the-post, applied to multi-member districts with each voter casting just one vote. Unlike FPTP, which is a single-winner system, in SNTV multiple winners are elected, typically in electoral districts; additionally, unlike FPTP, SNTV produces mixed representation and makes it unlikely for a single party to take all the seats in a city or a set area, which can happen under FPTP. Unlike block voting or limited voting, where each voter casts multiple votes (multiple non-transferable vote (MNTV)), under SNTV each voter casts just one vote. This usually produces semi-proportional representation at the district level, meaning small parties, as well as large parties, have a chance to be represented. Single transferable vote (STV) is a more proportional alternative to SNTV. Under STV, ranked voting allows unused votes (placed on winners or losers) to be transferred to other candidates. In any election, each voter casts one vote for one candidate in a multi-candidate race for multiple offices. Posts are filled by the candidates with the most votes (plurality voting). Thus, in a three-seat constituency, the three candidates receiving the largest numbers of votes would win office. SNTV, like single transferable vote, can be used with non-partisan ballots. Three seats are to be filled among five candidates: A, B, C, D and E fielded by 3 parties X, Y and Z. C, D and E are the winning candidates. Thus, Party Z gets two seats and Party Y gets one seat. No one party took all the seats as might have been the result under first past the post or plurality block voting. But counting the votes by party gives these vote tallies: Party Y has more votes than Party Z, but receives fewer seats because of an inefficient spread of votes across the candidates. If Party Y's two candidates had had more equal vote tallies, it would have won two seats and Party Z only one.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.