Partitioning and the online-world design problem for multi-player games

Natasha A. Neogi, Cedric Langbort

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2008 American Control Conference, ACC
Pages1697-1702
Number of pages6
DOIs
StatePublished - Sep 30 2008
Event2008 American Control Conference, ACC - Seattle, WA, United States
Duration: Jun 11 2008Jun 13 2008

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2008 American Control Conference, ACC
CountryUnited States
CitySeattle, WA
Period6/11/086/13/08

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Partitioning and the online-world design problem for multi-player games'. Together they form a unique fingerprint.

  • Cite this

    Neogi, N. A., & Langbort, C. (2008). Partitioning and the online-world design problem for multi-player games. In 2008 American Control Conference, ACC (pp. 1697-1702). [4586736] (Proceedings of the American Control Conference). https://doi.org/10.1109/ACC.2008.4586736