The first paper titled "Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology," authored by Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan, Nikolaos Melissinos, and Michal Opler deals with the design of parameterized algorithms for multiagent pathfinding. The second article, entitled "The Complexity of Fair Division of Indivisible Items with Externalities," with Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, and Šimon Schierreich, deals with the problem of a fair distribution of resources and studies algorithms that quickly find a fair distribution.
The goal of the AAAI conference is to promote research in artificial intelligence. Every year, the conference is attended by hundreds of scientists and experts from all over the world. By giving the opportunity to present their scientific paper, experts from FIT CTU were able to share their findings with scientists who are involved in various areas of artificial intelligence.