TY - GEN
T1 - Partitioning and the online-world design problem for multi-player games
AU - Neogi, Natasha A.
AU - Langbort, Cedric
PY - 2008
Y1 - 2008
N2 - A problem encountered in online multi-player gaming communities involves the following: Given a set of p players each of whom has strength pj, and a set of m monsters, each of whom has strength mi, is it possible to partition the players into groups such that each monster is assigned a group of players that is capable of overcoming said monster? A feasibility algorithm for the class restricted version of the problem, which has computational complexity O(p2(q-1) log2m) is developed, where q is the number of classes.
AB - A problem encountered in online multi-player gaming communities involves the following: Given a set of p players each of whom has strength pj, and a set of m monsters, each of whom has strength mi, is it possible to partition the players into groups such that each monster is assigned a group of players that is capable of overcoming said monster? A feasibility algorithm for the class restricted version of the problem, which has computational complexity O(p2(q-1) log2m) is developed, where q is the number of classes.
UR - http://www.scopus.com/inward/record.url?scp=52449093430&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52449093430&partnerID=8YFLogxK
U2 - 10.1109/ACC.2008.4586736
DO - 10.1109/ACC.2008.4586736
M3 - Conference contribution
AN - SCOPUS:52449093430
SN - 9781424420797
T3 - Proceedings of the American Control Conference
SP - 1697
EP - 1702
BT - 2008 American Control Conference, ACC
T2 - 2008 American Control Conference, ACC
Y2 - 11 June 2008 through 13 June 2008
ER -