Concept

Monotonicity criterion

The monotonicity criterion is a voting system criterion used to evaluate both single and multiple winner ranked voting systems. A ranked voting system is monotonic if it is neither possible to prevent the election of a candidate by ranking them higher on some of the ballots, nor possible to elect an otherwise unelected candidate by ranking them lower on some of the ballots (while nothing else is altered on any ballot). That is to say, in single winner elections no winner is harmed by up-ranking and no loser is helped by down-ranking. Douglas Woodall called the criterion mono-raise. Raising a candidate x on some ballots while changing the orders of other candidates does not constitute a failure of monotonicity. E.g., harming candidate x by changing some ballots from z > x > y to x > z > y would violate the monotonicity criterion, while harming candidate x by changing some ballots from z > x > y to x > y > z would not. The monotonicity criterion renders the intuition that there should be neither need to worry about harming a candidate by (nothing else than) up-ranking nor it should be possible to support a candidate by (nothing else than) counter-intuitively down-ranking. There are several variations of that criterion; e.g., what Douglas R. Woodall called mono-add-plump: A candidate x should not be harmed if further ballots are added that have x top with no second choice. Of the single-winner ranked voting systems, Borda, Schulze, ranked pairs, maximize affirmed majorities, descending solid coalitions, and descending acquiescing coalitions are monotonic, while Coombs' method, runoff voting, and instant-runoff voting (IRV) are not. The multi-winner single transferable vote (STV) system is also non-monotonic. While Woodall articulated monotonicity in the context of ordinal voting systems, the property can be generalized to cardinal voting and plurality voting systems by evaluating whether reducing or removing support for a candidate can help that candidate win an election.

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.