The purpose of this agent-based student admission model is to understand how each student admission mechanism affects the admissions of students in comparison with deferred acceptance under different levels of performance information released and number of choices allowed.
Entities, State Variables and Scales
Three types of entities are in the model: schools, students, and a central clearinghouse. Each school has the state variables of admission capacities, the lowest admission scores, and the lowest ranks of the students admitted. Each student has the attributes of score, school preference list, and school choice list. The central clearinghouse is represented by the admission policy, which regulates the matching mechanism used, the level of information to be released, and the number of school choices allowed. The admission policy is exogenously determined at the beginning of each run and remains constant throughout the run. Space in the model only represents student’ admission statuses. Admitted students move into the space of schools, while others stay outside of the schools. Each simulation step represents one year, and there are 30 years in each simulation run.
Process Overview and Scheduling
Each year, a set of admission candidates enters the system and stays outside of the 10 schools. Each candidate receives a score from a normal distribution and a true school preference list generated from a Zipf distribution. Each candidate then makes a decision to form a school-choice list. The central clearinghouse prioritizes the students and matches the students and the schools according to the admission mechanism. The admitted students move to the schools they are admitted to. After that, the schools update their lowest admission scores and the lowest ranks of the students they admitted. At the end of each year, the mismatch indexes are collected all students leave the system.
This is a companion discussion topic for the original entry at https://www.comses.net/codebases/4774/releases/1.0.0/