  |
Items where Author is "Paulusma, Daniel"
Group by: Item Type | No Grouping Jump to: Article | Book Section Number of items: 4. ArticleBenedek, Márton and Biró, Péter and Paulusma, Daniel and Ye, Xin (2024) Computing balanced solutions for large international kidney exchange schemes. AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 38. No. 18. ISSN 1387-2532 Benedek, Márton and Biró, Péter and Johnson, Matthew and Paulusma, Daniel and Ye, Xin (2023) The Complexity of Matching Games : A Survey. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 77. pp. 459-485. ISSN 1076-9757 Book SectionBenedek, Márton and Biró, Péter and Csáji, Gergely Kál and Johnson, Matthew and Paulusma, Daniel and Ye, Xin (2024) Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. In: AAMAS '24. IFAAMAS, [s.l.], pp. 2153-2155. ISBN 9798400704864 Biró, Péter and Kern, Walter and Pálvölgyi, Dömötör and Paulusma, Daniel (2019) Generalized Matching Games for International Kidney Exchange. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2019). International Foundation for Autonomous Agents and Multiagent Systems, Waterloo (CAN), pp. 413-421. ISBN 978-1-4503-6309-9 |
