algorithm - A self selecting team -

algorithm - A self selecting team -

a team consisting of 100 members assembled pool of 1000 applicants. each applicant gets pick 99 other applicants he/she have teammates.

each possible team gets score measures how satisfies team mate preferences of members. if lisa in team , 11 of people on lisas wishlist in team team gets 11 points lisa. points members added up. theoretical maximum possible team can 99*100. minimum 0.

now want find team highest score. trying brute forcefulness problem computing score each possible combination (≈ 10^140) not option.

is there clever algorithm take shortcut best reply or 1 have settle algorithm finds answer?

i think if solve efficiently solve http://en.wikipedia.org/wiki/clique_problem efficiently - there link between 2 nodes set each node on list of nodes other wants work with. looking @ article, think find hard find guaranteed approximation, unless problem has special construction it.

algorithm combinations genetic-algorithm mathematical-optimization