Multi-agent System for On-Line Game Matchmaking

Dan Latocha , Piotr Przemyslaw Arabas


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 Dan Latocha (FEIT / AK)
Dan Latocha ,,
- The Institute of Control and Computation Engineering
, Piotr Przemyslaw Arabas (FEIT / AK) - [Scientific and Academic Computer Network (NASK PIB)]
Piotr Przemyslaw Arabas,,
- The Institute of Control and Computation Engineering
- Naukowa i Akademicka Sieć Komputerowa
Publication size in sheets0.55
Book Szewczyk Roman, Kaliczyńska Małgorzata, Zieliński Cezary: Challenges in Automation, Robotics and Measurement Techniques. Proceedings of AUTOMATION-2016, March 2-4, 2016, Warsaw, Poland, Advances in Intelligent Systems and Computing, vol. 440, 2016, Springer International Publishing, ISBN 978-3-319-29356-1, [978-3-319-29357-8], 919 p., DOI:10.1007/978-3-319-29357-8
Keywords in EnglishMatchmaking MILP Multi-agent system
ProjectDevelopment of methodology of control, decision support and production management. Project leader: Zieliński Cezary, , Phone: 5102, start date 19-05-2015, end date 31-12-2016, 504/02233/1031, Completed
WEiTI Działalność statutowa
Languageen angielski
latocha arabas automation_2016.pdf 330.8 KB
Score (nominal)15
Score sourceconferenceIndex
ScoreMinisterial score = 15.0, 18-05-2020, BookChapterSeriesAndMatConfByConferenceseries
Ministerial score (2013-2016) = 15.0, 18-05-2020, BookChapterSeriesAndMatConfByConferenceseries
Publication indicators WoS Citations = 0
Citation count*
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?