This NetLogo model, a major revision of the “Agent-Based Modeling of School Admission Systems” model, is to simulate student admissions under different matching mechanisms (serial dictatorship, Boston mechanism, and Chinese Parallel), amount of information released, and strategies used to make school choices. The controlled information is students’ own scores and score ranks.
State Variables and Scales
The 10 schools, represented by their locations, are of the same admission capacities. Each student agent has a score and a preference list. Student agents’ spatial locations are not considered.
Depending on the initial setting, student scores are generated either randomly or from a normal distribution, of which the mean and standard deviation are from a normal distribution and a Chi-square distribution, respectively. Under the assumption of most students having similar school preferences, student preference lists are from a distribution similar to Zipf distribution. Student school choice lists are generated based on the strategy, number of choices allowed, matching mechanism, and information released. All students use the same school choice strategy. Three strategies are in the model and applied according to the amount of information released: to select schools randomly and sort them according to preference list, to select schools by reference to each school’s minimum score required for admission in previous year, and to select schools by reference to the lowest score ranks of the students admitted to each school last year. Then the model assigns the student agents to the schools based on matching mechanism and calculate mismatch index at the end of each run. Mismatch index is the average mismatch of the students, which is the difference between the actual school assigned and the school assigned to the student under serial dictatorship without school choice limitation.
This is a companion discussion topic for the original entry at https://www.comses.net/codebases/4407/releases/1.0.0/