Multi-agent System for On-Line Game Matchmaking
Dan Latocha , Piotr Przemyslaw Arabas
AbstractThe 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.
|Publication size in sheets||0.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 English||Matchmaking MILP Multi-agent system|
|project||Development 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
|Score|| = 15.0, 27-03-2017, BookChapterSeriesAndMatConf|
= 15.0, 27-03-2017, BookChapterSeriesAndMatConf
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.