School Choice with Hybrid Schedules

During the pandemic, school districts have adopted hybrid schedules to continue the education of the students while maintaining social distance. In a hybrid schedule, students in the same classroom are usually divided into two groups and students only in the same group can physically attend class together two days a week. School districts do not take preferences of the students/parents over the days they would like to come to school into account during this procedure. In this paper, we propose a solution that divides students into groups based on their preferences. Our solution respects the number of classrooms initially reserved for each grade and enables possible efficiency gains by swapping classrooms across grades. Moreover, when there are two alternative schedules provided for students, our solution is immune to preference manipulations.


Introduction
In the midst of the pandemic, school districts consider many different options to continue the education of the children while maintaining social distance. Online learning is one of the options that has been considered and applied by school districts. However, online learning falls short in the intellectual and social development of children. Moreover, the inequality that school choice was designed to eliminate has resurfaced. Lower income families are lacking the technology hardware, access to stable internet, and adult supervision to assist children with course content. While districts have implemented plans to distribute technology to their students, having a stable internet connection creates another hurdle for families who live in low income and rural areas [1,2]. Moreover, under online learning, some parents need to stay home to watch younger children and assist them with accessing courses and content. Unfortunately, some jobs are not suitable to work from home. Furthermore, parents who can afford to work from home may find it difficult to balance their job and assisting their child with work that would normally be handled by in-person instruction [3].
Complaints from parents, students, and teachers have led to a need for an alternative to online learning. Subsequently, school districts in the US and other countries have adopted various plans to limit class size which enables them to maintain social distancing and allow students to attend class physically. Three most widely used plans that have been implemented are the AM/PM hybrid model, the A/B hybrid model, and the three week rotation model. In the AM/PM hybrid model, students are divided into two cohorts where one cohort attends school in the morning and the other in the afternoon four days a week. The A/B hybrid model divides students into two groups, where each cohort attends in person two to three times a week for a full day. The three week rotation model divides students into three cohorts. Students in each cohort attend school in-person for one week and virtually for two. In Table 1, we list some of the school districts using these hybrid models.
School districts usually run their chosen plan by placing students into cohorts without providing choice. Some districts assign students into cohorts based on bus routes, e.g., Charlotte-Mecklenburg Schools and McDowell County. (See https://tinyurl.com/29 my55y6 and https://www.mcdowell.k12.nc.us/news/1685914/2020-2021-a-b-schedule, accessed on 20 April 2021). Some school districts, including Herricks and Hilliard City, simply divide students alphabetically into cohorts. (See https://www.herricks.org/cms/ lib/NY02208178/Centricity/Domain/1544/Reopening%20Plan%20Final.pdf and https: //www.hilliardschools.org/20-21/hybrid/, accessed on 20 April 2021). Not allowing for parents' input on the cohort their child is assigned causes potential issues. One issue is daycare for younger children. Some parents may not have the flexibility to adjust their work schedules to accommodate when their child is not in school [4]. This could force a parent to give up working hours and potentially decrease their pay. In 2018, 41.2 million workers had children under the age of 18, representing 32 percent of the workforce [5]. As a result of schools closing from the pandemic, by June 2020 13 percent of parents were forced to cut hours or quit [6]. Another potential issue is a family that has students across different schools. For example, a family could have a child in elementary school and middle school and can end up in two different rotations, further straining parent work schedules and need for daycare.
Allocation procedures ignoring parents' choices yield inequalities among students and avoidable efficiency losses. In this paper, we introduce choice into hybrid schedules provided by school districts during the pandemic. We call each schedule option as a shift. For instance, the AM/PM hybrid model consists of two shifts, i.e., AM and PM. Through the introduction of parents' preferences over shifts, we aim to improve the current allocation procedure that assigns students to their reserved classrooms' shifts without asking their preferences. To achieve our objective, we model this problem by incorporating the matching with contracts framework into the school choice problem. In particular, students have preferences over the shifts and for each shift a certain number of classrooms are reserved for each grade as in the current practice. Then, we assign students to shift-classroom pairs by not allowing students from different grades to be assigned to the same shift-classroom. For a given shift, students have a higher claim on the classrooms that are reserved for their grades. However, our choice based approach allows some students to be assigned a classroom reserved for another grade as long as it does not hurt students from that grade. Notice that, the current practice allows students to be assigned to only the classrooms reserved for their grade in each shift without taking preferences into account. We introduce a mechanism which is based on the celebrated deferred acceptance mechanism [7]. Our proposed mechanism assigns students to shift-classroom pairs in a non-wasteful way by respecting the within-grade priorities and initial reservation of the classrooms. Moreover, when the number of shifts is two, which is the common practice, reporting true preferences is a (weakly) dominant strategy for the students. When the number of shifts is more than two, any mechanism inheriting desired features can be manipulated by students.
The application of matching theory to school choice was first introduced in Balinski and Sönmez [8] and Abdulkadiroglu and Sönmez [9]. Balinski and Sönmez [8] show that the mechanism used in centralized college admission in Turkey is a variant of the college proposing deferred acceptance mechanism and it suffers severe deficiencies. They propose student proposing deferred acceptance (DA) mechanism, which is first introduced by Gale and Shapley [7] for marriage problem, as the first best solution in the centralized college admission. Abdulkadiroglu and Sönmez [9] study the public school choice systems in the US. They propose two strategy-proof mechanisms, DA and Top Trading Cycles mechanisms, to replace a highly manipulable mechanism that is commonly used by school districts. The other key contributions on school choice include, but not limited to, are Erdil and Ergin [10], Abdulkadiroglu et al. [11], Kesten [12], Pathak and Sönmez [13], Ehlers et al. [14], and Dur et al. [15]. We refer the readers to Pathak [16] and Pathak [17] for surveys in school choice. We construct our model in the framework of matching with contracts introduced by Hatfield and Milgrom [18]. They show when the choice function of the multi-unit demand side satisfy the law of aggregate demand and are substitutes, there exists a stable and strategy proof mechanism. Hatfield and Kojima [19] and Hatfield and Kojima [20] introduce two weaker conditions sufficient for the existence of a stable matching. The matching with contracts framework has been used to model matching markets including cadet-branch matching [21], inter-district school choice [22] and school choice with sibling guarantee [23]. Despite the importance of the law of aggregate demand condition for the strategy-proofness, as shown in the extant literature, we are able to obtain strategyproofness without it for the case of two-shift.
There is a literature on the shift scheduling problem with days-off preferences, mostly appearing in Operation Research journals (see [24]). While the current problem sounds similar to that, there are significant differences. In shift scheduling, the primary objective is to optimize agents' day-off assignments with respect to their day-off preferences over a certain time-window. In our setting, each grade has a reserved classroom in each shift, entailing individual rationality constraints, which are not present in the shift scheduling problem. Moreover, students are prioritized, therefore, fairness is different from that considered in the shift scheduling problems, where agents are not prioritized. Partly because of these differences, the pursued lines of researches are quite different as well.

Basics
School choice with hybrid schedules is based on the standard school choice problem introduced by Balinski and Sönmez [8] and Abdulkadiroglu and Sönmez [9]. We define this problem for a single school and focus on the assignment of students to the classroom-shift pairs in this single school. Shifts can be morning vs. afternoon or different days of a week. Usually, schools group students into two and allow the first group to come to school on two days of the week, say Monday and Tuesday, and allow the second group to come to school on the other two days of the week, say Thursday and Friday. See Table 1 in Introduction. Since the set of students enrolled to each school is predetermined, the assignment problem for each school is independent from the others. In particular, we have a single school and finite set of students denoted with s and I, respectively. Currently, all students in I are enrolled to the school s. We denote the classrooms in school s with C.
Let G be the set of grades. Let γ(i) ∈ G be the grade of student i. We represent the set of students in grade g with I g . Then, I g = {i ∈ I : γ(i) = g} for each g ∈ G. In the current practice, classrooms are reserved for the grades that they are assigned to the corresponding student. Let κ(c) ∈ G be the grade classroom c is reserved for. We represent grade g's reserved classrooms with C g , i.e., C g = {c ∈ C : κ(c) = g}.
We denote the set of available shifts with M. We would like to assign students to a classroom in a shift. We assume that students do not care about the exact classroom they are assigned but they care about the shift they are assigned. Each student i is equipped with (strict) preferences over M and an outside option, and it is denoted with P i . Here, the outside option can be considered as online learning and it is denoted with m 0 . If m o P i m, then we say shift m is unacceptable for student i.
School s has a strict priority order over the students in I g for every g ∈ G. We denote the priority order over students in I g with g . This priority order can be the priority order used to assign grade g students in the regular school assignment in the previous years. Alternatively, g can be an alphabetical order over students in I g . Notice that, we do not have a priority order that will allow us to rank students in different grades. A school may have its own rules to rank all students and such a ranking can be incorporated to our model and solution easily. Let = ( g ) g∈G .
Let q c be the capacity of classroom c ∈ C. For simplicity, we assume q c = q c = q for all c, c ∈ C. By the feasibility, |I g | ≤ q × |C g | for all g ∈ G.
In order to maintain the social distance amid the pandemic, schools need to limit the number of students in a classroom. Letq be the reduced capacity of classrooms at school s. In order to be able to allocate all students to a classroom and shift pair, we assumê We denote the maximum number of classrooms that can be used for grade g at school s during shift m with k g,m . Let k = (k g,m ) g∈G,m∈M . It is clear to see that k g,m ≤ |C| and it can be further limited due to the number of teachers who can teach grade g. Given |C g | classrooms are reserved for grade g at school s, we further assume |C g | ≤ k g,m .
In the rest of the paper, we fix all other elements but P and represent a problem (I, C, G, M, q,q, k, , P) with P.

Notions
In the current practice, schools usually reserve |C g | classrooms for each grade g at each shift m and assign students to the shift-classroom pairs accordingly. We would like to assign students to the shifts by taking their preferences into account and provide an improvement compared to the current practice. We can relate this problem to the standard school choice problem such that students are assigned to shifts instead of different schools. Differently, in this problem, students are further assigned to the classrooms in each shift and only the same grade students can be assigned to the same classroom in a given shift. To address these points, we work in the matching with contracts framework introduced by Hatfield and Milgrom [18]. Let X = (I × M × C) ∪ {x o } be the set of contracts such that x = (i, m, c) means student i is assigned to classroom c in shift m. Contract x o represents the online learning option. We denote student, classroom, and shift associated with contract , and m(x), respectively. With slight abuse of notation, we will use m(x o ) = m o . Given a subset of contracts Y ⊆ X, Y i , Y c and Y m represent the contracts associated with student i, classroom c and shift m, respectively. Let Y m,c = Y m ∩ Y c for any Y ⊆ X. Let YĪ = ∪ i∈Ī Y i for anyĪ ⊆ I.
Each student i ranks contracts in X i ∪ {x o } based on the shift she is assigned to. With slight abuse of notation, we denote student i's preferences over contracts in X i with P i such that m P i m and c = c implies (i, m, c) P i (i, m , c ). Moreover, student i is indifferent between contracts including the same shift. That is, student i is indifferent between (i, m, c) and (i, m, c ) for all m ∈ M and c, c ∈ C. We use R i to represent the associated weak relation order over X i ∪ {x o } and x R i x if and only if x P i x or m(x) = m(x ). If student i prefers online learning over shift m, then all contracts in X i ∩ X m are ranked below x o . Let P = (P i ) i∈I and R = (R i ) i∈I .
An assignment Y ⊂ X is a subset of contracts such that • |Y i | ≤ 1 for all i ∈ I and |Y m,c | ≤q for all c ∈ C, and m ∈ M; • γ(i(x)) = γ(i(x )) for all x, x ∈ Y m,c , c ∈ C, and m ∈ M; and • |{c ∈ C : x ∈ Y m,c and γ(i(x)) = g}| ≤ k g,m for all g ∈ G, and m ∈ M.
First bullet guarantees that capacity constraints are satisfied. The second bullet requires only students at the same grade can attend a classroom. The last bullet restricts the number of classrooms at each shift m assigned to the grade g students to be less than or equal to k g,m . If Y i = ∅, then student i is assigned to contract x o . In that case, with slight abuse of notation, we will use For a given assignment Y, we denote the set of classrooms in shift m in which grade g students are assigned with C m,g (Y), i.e., C m,g (Y) = {c ∈ C : x ∈ Y m,c and γ(i(x)) = g}.
A mechanism ψ is a procedure which selects an assignment for any problem. We denote the assignment selected by mechanism ψ for a given problem P with ψ(P) and assignment of student i with ψ i (P).
Our assumptions on capacities guarantee the existence of an assignment in which each student i ∈ I is assigned to a contract x = x o . The assignment procedure in practice usually works as follows: for each grade g, students in I g are split into |M| subgroups each with size less than or equal toq, and they are assigned to classrooms initially reserved to grade g in each acceptable shift according to g .
Next, we introduce the axioms that we use in our analysis. The first one requires each grade g student to have a guarantee for at least |C g | classrooms (i.e., the number of reserved classrooms) in each shift and no student is assigned to a contract worse than the outside option.
An assignment Y is individually rational if for each i ∈ I, Y i R i x o and whenever there existsx ∈ X i such thatx P i Y i then |{c ∈ C m(x),γ(i) (Y) : |Y m(x),c | =q}| ≥ |C γ(i) |.
Since students only care about the shift,x P i Y i implies that i prefers shift m(x) to m(Y i ), and therefore m(x) = m(Y i ). That is, whenever a student i strictly prefers contractx to her assignment, then the number of classrooms fully filled with grade γ(i) students at shift m(x) is at least the number of classrooms reserved for grade γ(i). The second axiom requires no seat to be wasted.
An assignment Y is non-wasteful if for each i ∈ I whenever there existsx ∈ X i such thatx P i Y i then the following is true: The first bullet says that all the seats in classrooms in C m(x),γ(i) (Y) are filled. The second bullets says if there is a classroom which has all its seats available in shift m(x) then grade γ(i) has reached its allowed number of classrooms for shift m(x). Our next axiom requires that the priority order within each grade should be respected.
An assignment Y is within-grade-fair if whenever there existsx ∈ X i such thatx P i Y i , then j γ(i) i for every j ∈ i(Y m(x) ) ∩ I γ(i) .
A mechanism ψ is individually rational (non-wasteful) [within-grade-fair], if it selects an individually rational (non-wasteful) [within-grade-fair] assignment for any problem.
A mechanism ψ is strategy-proof if a student i cannot be better off by misreporting her true preferences in any problem P, i.e., ψ i (P) R i ψ i (P i , P −i ) for all P i .

Results
We would like to introduce a mechanism which is individually rational, non-wasteful, within-grade-fair, and strategy-proof.
Recall that, students only care about the shift they are assigned to and indifferent between the classrooms. Hence, each student i is indifferent between any two contracts x and x such that i(x) = i(x ) and m(x) = m(x ). Moreover, it is not clear how students from different grades will be ranked and assigned to a shift m when it is not possible to assign all students asking for shift m. Under these two features of our model, it is even not clear how students will be assigned to classrooms when there is only one shift. To this end, we define a choice function for each shift m which determines the set of chosen students for shift m when a subset of studentsĪ is considered, and we denote it with Ch m (Ī) ⊆Ī. In order to calculate Ch m (Ī), we need a (strict) priority order over grades, denoted with π m and a (strict) precedence order over classrooms, denoted with m . Priority order π m determines which grade will be favored and precedence order m determines which classroom will be filled before the other ones in the selection procedure. Let π = (π m ) m∈M and = ( m ) m∈M and we fix these profiles throughout the paper. Now, we are ready to describe how Ch m (Ī) is calculated in two steps when we consider I ⊆ I and c k m c k+1 for all k ∈ {1, . . . , |C| − 1}.
Step A: Assigning students to reserved classrooms: Step A.1: IfĪ ∩ I κ(c 1 ) = ∅, then we select up toq students fromĪ ∩ I κ(c 1 ) for classroom c 1 according to κ(c 1 ) . Each selected student i for c 1 is added to Ch m (Ī) and removed fromĪ. We remove c 1 if some student is assigned to it.
In general, for each k ≤ |C|: Step A.k: IfĪ ∩ I κ(c k ) = ∅, then we select up toq students fromĪ ∩ I κ(c k ) for classroom c k according to κ(c k ) . Each selected student i for c k is added to Ch m (Ī) and removed fromĪ. We remove c k if some student is assigned to it.
Step B: Assigning students to unfilled classrooms: Step B.0 If the number of classrooms filled with grade g ∈ G students is k g,m , then all remaining students inĪ ∩ I g are removed.
Step B.1: If c 1 is removed, then we move to the next step. Otherwise, we consider grade g, if there is any, such that I g ∩Ī = ∅ and g π m g for all g = g with I g ∩Ī = ∅. Then, we select up toq students fromĪ ∩ I g for c 1 according to g . Each selected student i is added to Ch m (Ī) and removed fromĪ. If the number of classrooms filled with grade g students is k g,m , then all students inĪ ∩ I g are removed.
In general, for each k ≤ |C|: Step B.k: If c k is removed, then we move to the next step. Otherwise, we consider grade g, if there is any, such that I g ∩Ī = ∅ and g π m g for all g = g with I g ∩Ī = ∅. Then, we select up toq students fromĪ ∩ I g for c k according to g . Each selected student i is added to Ch m (Ī) and removed fromĪ. If the number of classrooms filled with grade g students is k g,m , then all students inĪ ∩ I g are removed.
We first highlight the following observations on the choice function for shifts. If i ∈Ī \ Ch m (Ī), then a. There does not exist a student j ∈ Ch m (Ī) such that γ(j) = γ(i) and i γ(i) j; b. Existence of a classroom c with no filled seat implies that the number of classrooms filled with grade γ(i) students is k γ(i),m ; c. No classroom, in which some grade γ(i) student assigned, has fewer grade γ(i) students thanq; and d. There are at least |C γ(i) | classrooms filled with grade γ(i) students.
Observation a. follows from the fact that grade γ(i) students are assigned to classrooms one by one according to γ(i) . Observations b. and c. follow from the fact that choice function Ch m considers all available students for each classroom c until that classroom is full or there does not exist any remaining student whose assignment to that classroom violates feasibility conditions. Observation d. follows from the fact that in Step A all classroom in C γ(i) are filled by students inĪ γ(i) .
Notice that, the choice function of shift m determines the set of students selected and it assigns each selected student to a specific classroom. In particular, when Ch m is applied to a subset of studentsĪ and student i is selected in Step A.k or Step B.k, then i is selected for classroom c k . Therefore, we can consider the outcome of Ch m not only as a subset of selected students but also a set of contracts such that selection of a student i for classroom c implies the selection of contract (i, m, c).
Next, we define two properties for the choice functions which are considered as desirable in the literature. These two properties guarantee existence of strategy-proof and stable mechanisms in the two-sided matching with contracts framework (see [18]). We say a choice function for shift m, Ch m , is substitutable if for anyĪ ⊂ I and i, j / ∈Ī i / ∈ Ch m (Ī ∪ {i}) implies i / ∈ Ch m (Ī ∪ {i, j}). We say a choice function for shift m, Ch m , satisfies law of aggregate demand (LAD) if |Ch m (Ī)| ≤ |Ch m (Î)| for anyĪ ⊂Î ⊆ I.
In Proposition 1, we show that choice function Ch m satisfies substitutability but not law of aggregate demand. Proposition 1. Choice function Ch m is substitutable but does not satisfy law of aggregate demand.
Proof. We start with substituability. On the contrary, suppose Ch m is not substitutable.
Step A all classrooms in γ(i) are filled by students in I γ(i) \ {i}. That is, there are at leastq × |C γ(i) | students inĪ γ(i) who are ranked above i under γ(i) . Hence, the number of grade γ(i) students inĪ ∪ {j} who are ranked above i under γ(i) is at leastq × |C γ(i) | and i cannot be assigned to a classroom in Step A when Ch m is applied toĪ ∪ {i, j}.
LetĪ andĪ be the set of remaining students for Step B (i.e., after Step A is implemented) when Ch m is applied toĪ ∪ {i} andĪ ∪ {i, j}, respectively. As explained above, i ∈Ī ∩Ī . Moreover, since inclusion of j to the set of students does not result in an extra student to be selected in Step A, we haveĪ ⊆Ī . LetC andC be the set of remaining classrooms for Step B (i.e., after Step A is implemented) when Ch m is applied toĪ ∪ {i} andĪ ∪ {i, j}, respectively. By the definition of Step A, we haveC ⊆C . As a result, students who are assigned to classroom c ∈ C under Ch m (Ī ∪ {i}) will be available when we consider that classroom in Step B of Ch m (Ī ∪ {i, j}). Hence, i / ∈ Ch m (Ī ∪ {i}) implies that i / ∈ Ch m (Ī ∪ {i, j}). This is a contradiction.
We prove Ch m does not satisfy LAD by an example. LetĪ = {h, i, j, k, } such that Now, we are ready to define our proposal. Our proposed mechanism is the celebrated (generalized) DA [7,9] in which we use the choice functions introduced for shifts. Given a problem P, (generalized) DA mechanism selects its outcome by first selecting students for the shifts and then determining the corresponding contract as follows.
Generalized DA Mechanism: Step 1: Each student i ∈ I proposes to the best shift under P i , possibly m o . Let A m 1 be the set of applicants for shift m ∈ M in Step 1. Shift m ∈ M tentatively holds students in Ch m (A m 1 ) and rejects all students in A m 1 \ Ch m (A m 1 ). In general for all h > 1, Step h: Each student i ∈ I proposes to the best shift under P i , possibly m o , which has not rejected her yet. Let A m h be the set of applicants for shift m ∈ M in Step h. Shift m ∈ M tentatively holds students in Ch m (A m h ) and rejects all students in A m h \ Ch m (A m h ). The selection procedure of students terminates when no student is rejected from the shift she proposes. Leth be the terminal step. For each i ∈ I, if i ∈ A m h = Ch m (A m h ) and Ch m (A m h ) assigns i to classroom c, then the assignment of student i under the generalized DA mechanism is (i, m, c). If i / ∈ A m h for any m ∈ M, then the assignment of student i under the generalized DA mechanism is x o .
We first show that generalized DA mechanism is individually rational, non-wasteful and within-grade-fair.
Proof. Let µ be the assignment selected by generalized DA under an arbitrary problem P. Let A m = i(µ m ), i.e., the set of students signing a contract with shift m under assignment µ. Aygün and Sönmez [25] show that irrelevance of rejected contracts plays crucial role in the existence of stable assignment in matching with contracts framework. It is easy to verify that shift choice function satisfies this property. Proposition 1 and Hatfield and Milgrom [18] imply that In the rest of the proof, we use these conditions. Individual rationality: On the contrary, suppose µ is not individually rational. Since no student proposes to an unacceptable shift, all students are assigned to either x o or some acceptable contract. Then, there exist i ∈ I andx ∈ X i such thatx P i µ i and |{c ∈ C m(x),γ(i) (µ) : |µ c,m(x) | =q}| < |C γ(i) |. During the application of the generalized DA mechanism, i has applied to shift m(x) and she has been rejected. We consider A m(x) ∪ {i} under choice function Ch m(x) . Condition |{c ∈ C m(x),γ(i) (µ) : |µ c,m(x) | = q}| < |C γ(i) | implies that either there exists c ∈ C m(x),γ(i) (µ) such that |µ c,m(x) | <q or |C m(x),γ(i) (µ)| < |C γ(i) |. In either case, by the definition of choice function Ch m(x) , we have i ∈ Ch m(x) (A m(x) ∪ {i}). However, this contradicts condition (ii) above.
During the application of the generalized DA mechanism, i has applied to shift m(x), and she has been rejected. We consider A m(x) ∪ {i} under choice function Ch m(x) . If either condition holds, by the definition of choice function Ch m(x) , we have i ∈ Ch m(x) (A m(x) ∪ {i}). This follows from the fact that choice function Ch m fills the seats of all classrooms as long as feasibility requirements (e.g., not assigning different grade students to the same classroom and not using more than k g,m classroom for each grade g) are not violated. However, this, i ∈ Ch m(x) (A m(x) ∪ {i}), contradicts condition (ii).
Within-grade-fairness: On the contrary suppose µ is not within-grade-fair. Then, there exist i, j ∈ I andx ∈ X i such thatx P i µ i , γ(i) = γ(j), i γ(i) j and m(µ j ) = m(x).
. This follows from the fact that choice function Ch m selects students from grade γ(i) according to γ(i) . However, this contradicts condition (ii).
Unfortunately, generalized DA fails to be strategy-proof without restricting the environment. In fact, next we show that when the number of shifts is strictly more than two, then there does not exist an individually rational, non-wasteful, strategy-proof and within-grade-fair mechanism. Proposition 3. When |M| > 2, there does not exist an individually rational, non-wasteful and within-grade-fair mechanism which is strategy-proof.
Proof. We prove this result by taking |M| = 3 and |G| = 2 and constructing an example. One can easily construct an example for higher number of shifts and grades similarly.
Let M = {m 1 , m 2 , m 3 } and G = {1, 2}. There are six students in Grade 1, I 1 = {i 1 , i 2 , i 3 , i 4 , i 5 , i 6 }, and four students in Grade 2, Student preferences over shifts and within-grade priority orders are given as: P i 1 P i 2 P i 3 P i 4 P i 5 P i 6 P j 1 P j 2 P j 3 P j In any individually rational, non-wasteful and within-grade-fair matching under problem P, i 1 , i 2 and j 4 are matched with contracts including m 1 , i 3 , i 4 and j 3 are matched with contracts including m 2 , and i 5 , i 6 , j 1 and j 2 are matched with contracts including m 3 . Now, suppose i 5 reports her preferences over shifts as follows: P i 5 : m 2 P i 5 m 0 P i 5 m 1 P i 5 m 3 . Let P = (P i 5 , P −i 5 ). In any individually rational, non-wasteful and within-grade-fair matching under problem P , either a. i 1 , i 2 , i 3 and i 6 are matched with contracts including m 1 , i 4 and i 5 are matched with contracts including m 2 , and j 1 , j 2 , j 3 and j 4 are matched with contracts including m 3 ; or b. i 1 , i 2 and j 4 are matched with contracts including m 1 , i 3 , i 4 and j 3 are matched with contracts including m 2 , and j 1 , j 2 , and i 6 are matched with contracts including m 3 .
If bullet a. holds, then under problem P i 5 can profitably manipulate any individually rational, non-wasteful and within-grade-fair mechanism. Suppose bullet b. holds. Let P i 6 : m 1 P i 6 m 0 P i 6 m 3 P i 6 m 2 and P = (P i 6 , P −i 6 ). In any individually rational, nonwasteful and within-grade-fair matching under problem P , i 1 , i 2 , i 3 and i 6 are matched with contracts including m 1 , i 4 and i 5 are matched with contracts including m 2 , and j 1 , j 2 , j 3 and j 4 are matched with contracts including m 3 . Then, under problem P i 6 can profitably manipulate any individually rational, non-wasteful and within-grade-fair mechanism selecting the allocation in bullet b. This completes the proof.
In current practice, the number of shifts is usually two. In the following proposition, we show that when |M| = 2 generalized DA cannot be manipulated by a student. Proposition 4. When |M| = 2, then generalized DA cannot be manipulated by a student.
Proof. Let µ be the outcome of generalized DA under some problem P. By individual rationality and non-wastefulness, every student is assigned to a classroom in an acceptable shift or m o (i.e., contract x o ) in µ. In particular, a student can be assigned to m o , µ i = x o , in the case she ranks at least one shift unacceptable. That is, every student is assigned to a contract with either her top or second choice shift, possibly m o . A student who is assigned to her top choice shift does not need to misreport her preference order. By individual rationality, any student ranking m o as top choice is assigned to m o . Consider a student i who is assigned to her second choice shift, possibly m o . By non-wastefulness, individual rationality and within-grade-fairness of µ, in the top choice shift of i, all the classrooms in C γ(i) are filled with students who are ranked above i under γ(i) . In particular, the number of students in I γ(i) top ranking i's top choice shift and having higher priority than i is at least |C γ(i) | ×q. Since |I γ(i) | ≤ |C γ(i) | ×q × |M|, if i top ranks any shift other than her true top choice, she will be assigned to a contract with that shift. Moreover, if she swaps her second and third choices, then she is either assigned to x o or a contract with an unacceptable shift. As a result, i does not have profitable deviation strategy under generalized DA.

Conclusions
During the pandemic, school districts provide different options to the families for the continuation of students' education while maintaining social distancing mandated by states and governments. These options usually divide students in each grade into two and allow each group to attend school physically two days a week or either morning or afternoon four days a week. However, in this process, families preferences are not taken into account. In this paper, we provide a solution which is based on the celebrated deferred acceptance mechanism. Our solution respects the number of classrooms reserved to each grade in the current practice and it assigns students to the schedules (or shifts) in a non-wasteful way by taking the within-grade priority orders into account. Moreover, it is immune to preference manipulations when there are only two schedules (which is a common situation in practice).