If deemed necessary, reported comments will be removed within 7 - 10 days but usually sooner. Please submit this report ONLY if you STRONGLY believe this needs to be removed. Multiple illegitimate reports slow down the administrative process of removing the actual and more seriously unfavorable content.

Poster Name:
Rush computer

Poster Message:
The way it works is PNMs rank their pref chapters and chapters rank their PNMs. Each chapter has a "first bid list" equal to the number Panhellenic sets for quota. The computer first matches up all the first bid list + first choice matches. (Ex: Suzie preffed ABC and put them first, and ABC also put her in their first bid list.) Then, it goes through and keeps trying to match each PNM to her first choice until that first choice chapter is full. (Ex: Suzie preffed ABC and put them first, and ABC did not put her on the first bid list, but put her third on their second bid list. After matching up all the first matches, ABC has five of their 'first bid list' PNMs who have matched elsewhere, so if any of their next five ranked PNMs put them first, they match. In this case, Suzie would match and get a bid to ABC.) Once a chapter is full, then the computer tries to match the PNM's second ranked chapter. (Ex: Suzie preffed ABC and DEF and picked ABC first and DEF second. ABC put her in thirtieth place on the second bid list, and ABC matches with enough PNMs that they do not get to Suzie's name on their list before their class is full. The computer then tries to match Suzie with DEF, where she was on their first bid list. They match and Suzie gets a bid to DEF.). If both her first AND second ranked chapters fill before her name matches, then the computer tries to match her with her third chapter.