Professional Documents
Culture Documents
BPS May112005presentation1
BPS May112005presentation1
Contents
I.
II.
V. Next Steps
What is an Algorithm?
Priorities
Preferences
Random Numbers
What Is an Algorithm?
An algorithm is a set of ordered steps for SOLVING A
PROBLEM, such as a mathematical formula
or the instructions in a program.
Computer Desktop Encyclopedia, 1988-2004, Computer Language Company, Inc.
SIBLING / WALK
2.
SIBLING / NON-WALK
3.
WALK
4.
NO PRIORITY
RANDOM NUMBERS order students who fall into the same priority category
Murphy
2nd choice:
Channing
3rd choice:
Perkins
Estella
CHOICE
SIBLING
WALK
RANDOM#
MURPHY
NO
NO
CHANNING
YES
NO
PERKINS
NO
YES
Estellas Priorities
2nd Choice
3rd Choice
Sib-Walk
Sib-Walk
Sib-Walk
Sib
Sib
Sib
Walk
No Priority
As
space is
available
Walk
No Priority
As
space is
available
Walk
No Priority
Sib-Walk
Students in 3
priority categories
are ahead of
Estella
Sib
Walk
None
10
Estella
The
school
may be
filled by
this point
PERKINS
1st Choice
2nd Choice
3rd Choice
Sib-Walk
Sib-Walk
Sib-Walk
MURPHY
Sib
11
As
space is
available
Sib
As
space is
available
Sib
Walk
Walk
Walk
None
None
None
12
Chance
Because?
Channing
Best chance
Sibling priority.
Medium Popularity.
Perkins
Good chance
Murphy
Worst chance
They have no
priority.
Very Popular.
13
1st choice:
Murphy Channing
2nd choice:
Channing
Murphy
3rd choice:
Perkins
14
MURPHY
PERKINS
1st Choice
2nd Choice
3rd Choice
Sib-Walk
Sib-Walk
Sib-Walk
Sib
15
As
space is
available
Sib
As
space is
available
Sib
Walk
Walk
Walk
None
None
None
16
The BPS has been working with a team of economists who are experts
on these alternatives
These economists are helping the BPS explore the potential benefits of
switching to one of these alternatives
17
Sibling
Walk
No Priority
1st choice
1st choice
1st choice
1st choice
2nd choice
2nd choice
2nd choice
2nd choice
3rd choice
3rd choice
3rd choice
3rd choice
4th choice
4th choice
4th choice
4th choice
Sibling
1st choice
Walk
No Priority
1st choice
1st choice
MURPHY
2nd choice
2nd choice
2nd choice
2nd choice
3rd choice
3rd choice
CHANNING
3rd choice
3rd choice
PERKINS
4th choice
18
4th choice
4th choice
4th choice
Gale-Shapley Method
19
all
priorities and
preferences
throughout the
whole assignment
process
Eliminates
the need
for families to
strategize
20
CON:
Considers
priorities more
strongly than 1st
choices
Is not focused on
providing the
highest percentage
of 1st choices
Estella
CHANNING
21
Frank
Priorities & Positions
Will Be Traded
MURPHY
PERKINS
CHANNING (1st)
MURPHY (1st)
PERKINS
22
23
BPS
24
Rewards
Strategizing?
Holds
Place in
Line?
Strongest
Driver:
Rewards
True
Choices?
YES
NO
FIRST
NOT
CHOICE
ALWAYS
GaleShapley
NO
YES
PRIORITIES;
ANY CHOICE
YES
Top
Trading
Cycles
NO
YES
TOP
CHOICES;
TRADING
YES
The
25
2.
3.
26
Many families who do not adequately take this risk into account receive
worse assignments than they otherwise could have.
The adoption of a strategy-proof algorithm, when holding current choice
patterns constant, does not significantly change the outcome of the assignment
process while removing the risk of ranking schools in simple order of
preference.
Adopting a strategy-proof algorithm would:
80%
78%
80%
79%
77%
76%
78%
77%
75%
75%75%
74%
74%
72%
70%
27
Grade K2
Grade 6
Grade 9
Current
Gale-Shapley
Top Trading
So Why Change?
A Comparison of the Three Algorithms
28
100%
90%
80%
70%
60%
50%
40%
30%
20%
10%
0%
Likely
Safety Schools
52%
67%
74%
Other**
Over-demanded*
48%
33%
26%
29
*Based on previous years choice figures. **Other includes times when no 2 nd or 3rd choice is made.
160
140
151
1st 3rd Choices
more evenly
distributed at
Trotter
120
100
80
60
40
34
45
31
30 24
20
0
1st
Choice
30
2nd
Choice
3rd
Choice
Lyndon
Trotter
11 10
8 7
4th
Choice
5th
Choice
31
Roughly 45% of students who received their third choice or lower would
have benefited from removing an over-demanded school as their top
choice.
32
33
2.
Harbor
3.
McCormack
4.
Lewenberg
34
1.
The adoption of a strategy-proof algorithm (GaleShapley Deferred Acceptance Mechanism or the Top
Trading Cycles Mechanism) will take the high-stakes
gamble out of the assignment process.
2.
35
3.
4.
5.
Conclusion
36
A Strategy-Proof Algorithm:
37
Students will receive their highest choice among their school choices
for which they have high enough priority to be assigned. The final
assignment has the property that a student is not assigned to a school
that he would prefer only if every student who is assigned to that
school has a higher priority at that school.
38
This trading of priorities could lead families to believe they can still
benefit from strategizing, as they may be encouraged to rank
schools to which they have priority, even if they would not have put
it on the form if the opportunity for trading did not exist.
V. Next Steps
39
Questions?
40