Abstract
The task of choosing players to form optimal games is formulated as a binary mathematical programing problem. An efficient heuristic is proposed and decomposed to build a multi-agent system. The quality of such a solution is compared with the quality of the exact one, found with the MILP solver. The scalability of the system is verified by numerical experiments.
Author supplied keywords
Cite
CITATION STYLE
APA
Latocha, D., & Arabas, P. (2016). Multi-agent system for on-line game matchmaking. In Advances in Intelligent Systems and Computing (Vol. 440, pp. 245–256). Springer Verlag. https://doi.org/10.1007/978-3-319-29357-8_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free