GreekChat.com Forums  

Go Back   GreekChat.com Forums > Recruitment > Sorority Recruitment
Register FAQ Community Calendar Today's Posts Search

Sorority Recruitment Recruitment event and bid day ideas, membership retention, publicity, recruitment policies, etc.

» GC Stats
Members: 329,794
Threads: 115,673
Posts: 2,205,421
Welcome to our newest member, wangjewelry
» Online Users: 2,674
0 members and 2,674 guests
No Members online
Reply
 
Thread Tools Display Modes
  #1  
Old 09-03-2014, 05:21 PM
Titchou Titchou is offline
GreekChat Member
 
Join Date: Jul 2003
Location: Sweet Home Alabama
Posts: 4,598
They look at all of it. It's not an either/or thing. So, it could go either way at any given time. The goal is to place the most women in the highest placement possible. So they try to determine what that is.
Reply With Quote
  #2  
Old 09-03-2014, 05:57 PM
DeltaBetaBaby DeltaBetaBaby is offline
GreekChat Member
 
Join Date: Jul 2001
Location: ILL-INI
Posts: 7,207
Send a message via AIM to DeltaBetaBaby
Quote:
Originally Posted by Titchou View Post
They look at all of it. It's not an either/or thing. So, it could go either way at any given time. The goal is to place the most women in the highest placement possible. So they try to determine what that is.
Okay, my question was mainly around whether they looked at WHERE women placed.

I'm always interested in the pieces done by hand, rather than automated, and why/how they are done by hand. In this case, automation would be an Integer Program (IP) something like:

Maximize "Total PNM happiness"
by changing the variable "quota"
subject to "all chapters make quota"

Basically, you'd come up with some sort of measure of PNM happiness, like 3 points for a woman placed in her first choice, 2 for a woman placed in her second choice, and one for a woman placed in her third choice. Then each time bid matching was run for a different value of quota, a value for Total PNM happiness could be calculated, and there'd be a "best" value of quota.

I'm not sure that "all chapters make quota" would be a hard constraint, though, as we know that won't happen at all on some campuses. Rather, I'd adjust the objective function to call it something like "CPH Strength" and define it as "Total PNM happiness - missed quota penalty," i.e. for each chapter not making quota, we'd subtract some quantity from the total PNM happiness.

Of course, you can't *really* just hand it over to the computer...who decides if a PNM in her first choice is three times happier than in her third choice, or four times? Maybe the points should be 4-2-1 or 6-3-1 instead of 3-2-1.

Even if someone were to write the program and hand it over to the computer during bid matching, the fact remains that the design would require a huge amount of up-front subjective judgment calls. In any case, I think it's fun to think about, and a good example of why real-world modeling is very difficult.

I think I'd make missed quota a huge penalty, because that way, if a chapter was NEVER going to make quota, it would apply to every scenario, and wouldn't make a difference, but if a chapter makes quota under some scenarios and not others, it would automatically avoid the latter. But then again, does it matter if a chapter misses quota by one instead of making quota? Then why penalize by number of chapters missing quota rather than the number of women they are below quota?
Reply With Quote
Reply


Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off


Similar Threads
Thread Thread Starter Forum Replies Last Post
Bid Matching Glitter650 Sorority Recruitment 4 11-29-2006 09:00 PM
bid matching CAREPHISIG Phi Sigma Sigma 3 08-17-2005 01:15 AM
Self-Improvements in Light of Past Relationships SummerChild Alpha Kappa Alpha 16 07-11-2005 06:42 PM
Bid Matching Question Buttonz Recruitment 4 10-07-2004 01:03 PM
? About Bid Matching Buttonz Recruitment 8 11-13-2003 10:13 PM


All times are GMT -4. The time now is 05:21 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2025, vBulletin Solutions Inc.