Multi-agent System for On-Line Game Matchmaking
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.
Author Pages 245-256 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 DOI DOI:10.1007/978-3-319-29357-8_22 URL
http://link.springer.com/chapter/10.1007/978-3-319-29357-8_22 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
Language en angielski File
latocha arabas automation_2016.pdf
Score (nominal) 15 Score = 15.0, 04-09-2019, BookChapterSeriesAndMatConfByConferenceseries = 15.0, 04-09-2019, BookChapterSeriesAndMatConfByConferenceseries Citation count* * presented citation count is obtained through Internet information analysis and it is close to the number calculated by the
Publish or Perish system.