The losing candidates are eliminated, and their votes are transferred to the remaining candidates. In addition to finding the candidate with the maximum votes, the method also finds the maximum and minimum votes of the winning candidates.įigure 2 shows the results with only the first preference votes. but as candidates are eliminated, the two will not be the same. index and candidate are the same for the first pref vote The methods given above just take a random vote and store the result in suitable lists. The ‘ask patches’ loops over each patch/constituency. Set nextPref replace-item candidate nextPref votes2 Set votes2 replace-item pref2 votes2 ( item pref2 votes2 + 1 )
#NETLOGO LPUT UPDATE#
increment the vote count and update the list of lists each remaining candidate gets the same chance select the list for for first preference candidate
#NETLOGO LPUT PATCH#
change the colour of the patch to the current candidate Set votes replace-item candidate votes ( item candidate votes + 1 ) increment the vote count of the candidate
#NETLOGO LPUT MOD#
Set candidate random (NCandidates + NPreferred) mod NCandidates the first NPreferred candidates get double the chance The loop stops when each voter has voted and the result computed. In the interface, the Go button will have ‘Forever’ ticked. The result is for six candidates, where three of them have double the chance of winning. Set initListOfList lput n-values NCandidates initListOfListĮnd Figure 2: The results after the main vote. add a list of N 0’s as the last element of the list The second preference votes are added to the votes of the candidates who have not been eliminated. The last two variables, loser and listc, are needed to process the second preference votes of the current loser. The lists, votes and nextPref keep count of the first and second preference votes. The patches-own are variables that are for each patch, which, in our case, is a constituency. If you have programmed in Python, you will need to keep looking at the syntax but programming will not be that difficult. The coding style is heavily oriented towards functional list processing paradigms. If you remember Logo from your school days, you can get a feel for the programming style. Hence, this will need to be a list of lists, in which each list represents the votes cast for a candidate, given that the first preference vote was for a specific candidate. We need to be able to count them and check if the first preference candidate has been eliminated. Keeping track of second preference votes is trickier. For each constituency, we need an array or a list with a vote count for each candidate. Keeping track of first preference votes is easy. The colour of a square indicates the winner of the patch The result shown is for six candidates whereby each has an equal chance. Figure 1: An interface for the simulation. The button for processing the second preference votes will display the result (after the second preference votes have been processed). The Go button counts the votes and shows the results based on the first preference votes. However, we will configure the preferred candidates, who will have double the chance of getting a vote.įigure 1 displays the interface for this model. The first vote will be for any one candidate, and the second one for any other candidate.įor the sake of simplicity, voting will be random. Each tick will represent a voter voting.Įach voter will vote twice. Each constituency will have N candidates, the number of which will vary at runtime. We will assume that each patch represents a constituency. NetLogo is based on the concept of patches. The application we will use is NetLogo, which is ‘a multi-agent programmable modelling environment’. Let us model an instant run-off election with only a second preference vote.
However, it is fun to see if we can simulate outcomes by modelling an election. Given the time and effort involved in the Indian elections, the instant run-off would seem to be an attractive alternative. There is also the possibility of an instant run-off in which everyone votes for multiple candidates in the order of preference. Many countries use a run-off between the top two candidates, and the leader of the first round may not make it through the second round.
Intuitively, we understand that an election’s outcome will be affected by the nature of the process.
#NETLOGO LPUT CODE#
We explore the code in such a situation, and look at how the winner is determined. The author takes this opportunity to explore a different kind of electoral system, in which votes are given to candidates in order of preference. It is election time in India and the whole country is watching the latest election news, discussing the functioning of EVMs and the code these use, and talking about which party will form the new government.
0 kommentar(er)
