I've reviewed most of those, including step 3. It amazes me that so many of you completely don't get that the specific example we're talking about is not outlined in Step 3. The example, for the zillionth time, is: Student A has sibling preferenc at school A but ranked it #3. Student A's randomly assigned lottery number is 10. Student A has no other preferences (adding part about lottery number and no other preferences just to further clarify the question). By the time Student A is being considered for school A, they have already not gotten spots at their 1st and 2nd choice schools. Student B also has sibling preference at school A but ranked it #1. Student B's randomly assigned lottery number is 20. Student B has no other preferences. Show me the official source that says either: "Student A will get the spot because their random lottery number is higher" or "Student B ranking school A will NOT give student B an advantage over Student A". Don't just link, show the specific place where it is clearly stated/explained that Student A trumps B no matter what in this scenario. |
Lottery number trumps unless a preference trumps, why is this so complicated? |
It's not. |
LOL. What are you trying to say? That someone here is trying to throw everyone off so they can get a better chance in the lottery? Either way, you should rank your schools in order of your actual preferences. The end. |
doctors go through a matching algorithm nationwide, this kind of thing can function |
It's quite complicated and quite simple:
Since it's a deferred acceptance model a single student can ask for the same seat multiple times. They might not get the seat in the 1st, 2nd or 15,000th iteration but they could on the 15,001st. And that can have an effect an another student and so on an etc. It's also then entirely possible that on the 18,243rd time they give up that seat to take a better one and the whole thing loops again until the closing arguments are met. I believe what the algorithm does is simply this process by applying a mathematical methodology. |
It is the same basic algorithm as the resident matching program. But this does not change that you should still order your preferences the same way you would if it were last year's system. |
From the FAQ:
1. If two students have the same preference, lottery number determines which one gets it. 2. Ranking a school higher is not a preference. 3. In this scenario, the child with with the better lottery number gets the slot. |
First and foremost your example is flawed because it shows only 2 students and 3 schools. Demand for those seats isn't high enough to represent a true example... but I digress and will make this work by forcing Student 1's first and second choice schools to have zero seats offered in the lottery. This is answered in the PDF that talks about gale/shapely. As a matter of fact a diagram exists that explains it. Student A gets the spot because they have a higher lottery number and are therefore preferred by the school for that slot. Here is the relevant diagram for your example: Student Ranking Schools (based on true preference): i1: sB, sC, sA i2: sA, sB, sC Schools Ranking Students (based on preference and lottery #): sA: i1, i2 sB: no seats/preference sC: no seats/preference School A is the only school with seats in this lottery. Now, when ranked purely by lottery number (and not preference) the students are sorted as i1, i2, i3. So i1 goes first. i1 asks sB for a seat. sB says no. we move on to i2. i2 asks for sA. sA says yes. i1 then asks for sC. sC says no. i1 then asks for sA. sA sees that i1 is ranked higher than a student it previously accepted. it removes acceptance from the lowest ranked student (i2) and takes the seat back, giving it to i1. i2 then asks sB for a seat. sB says no. i2 then asks sC for a seat. sC says no. This all happened because i1 had a better preference/lottery # combination. There are plenty of examples like this in the documents linked above. |
Where in the section from the website does it say that in the top situation, a random lottery number trumps preference? It says "Then, random selection decides which other students will be offered spaces". But it also says "Students will be matched with no more than one school. My School DC will try to match each student with their 1st choice, then their 2nd choice, and so on through the student’s list." What I was TOLD is that in a situation where all else is equal (meaning preferences and no one got into a school they ranked better yet), it is not your random lottery number but your ranking of the school that will determine if you get it. If you both ranked the school 1, the lottery number will be the tie breaker. But if one student didn't rank 1 and all else is equal, they're not in the running against the student who ranked it 1. The algorithm is only looking to distinguish first/match first between those where all else is equal, including how they ranked the school. Show me where it is clearly stated that random lottery number trumps student's ranking of the school and, where all else is equal except the student's rank of the school, a higher random lottery number trumps student's ranking of school? |
Thank you. Folks, see the bolded above. The FAQ is clear. There is nothing, NOTHING, that states that ranking a school higher will give you more weight in the lottery. ::drops mic, exits forum:: |
What does "i" mean in "i1 and i2"? And when this says "i1 asks SB for a seat", what does it mean that i "asks a student for a seat and the student says no"? How does the computer "ask a student for a seat" and how does the student "say no" in this year's DC common lottery process? Please break that down into plain terms, thanks. |
Clarification - I assume "i" is the school, but you threw me with "i1 asks sB for a seat", so just making sure. |
"i" is the student
"s" is the school I thought that was clear by stating
anything else that isn't clear? |
I am not the PP whom you are quoting, but basically the way it works is that in the algorithm, the computer model has the student "asks" for a seat to the school for their first choice. They are temporarily assigned a seat or rejected by the school (again, all done by computer--student doesn't actually ask someone at the school). Then the students who didn't get in during the prior round ask their next choice school, and the schools reconsider the people who got in the first round with the people who are asking in the second round based on the random lottery numbers and chooses schools. Then the people who no longer have seats after round 2 ask for their next choice school, etc. etc. Again, all done by computer based on the student's rankings (with those with clear preferences--IB, sib, etc. --going in first, then everyone else) along with the random lottery # order generated by the computer for the schools. |