Márton Benedek
Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded
Benedek, Márton; Biró, Péter; Csáji, Gergely; Johnson, Matthew; Paulusma, Daniel; Ye, Xin
Authors
Péter Biró
Gergely Csáji
Professor Matthew Johnson matthew.johnson2@durham.ac.uk
Head Of Department
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
Xin Ye xin.ye@durham.ac.uk
PGR Student Doctor of Philosophy
Citation
Benedek, M., Biró, P., Csáji, G., Johnson, M., Paulusma, D., & Ye, X. (2024, May). Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded. Presented at AAMAS, Auckland, New Zealand
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | AAMAS |
Start Date | May 6, 2024 |
End Date | May 10, 2024 |
Acceptance Date | Feb 8, 2024 |
Online Publication Date | May 6, 2024 |
Publication Date | May 6, 2024 |
Deposit Date | Dec 31, 2024 |
Publicly Available Date | Jan 3, 2025 |
Peer Reviewed | Peer Reviewed |
Pages | 2153-2155 |
Book Title | Proceedings of AAMAS-2024 |
ISBN | 9781400704864 |
Public URL | https://durham-repository.worktribe.com/output/3230238 |
Publisher URL | https://www.ifaamas.org/Proceedings/aamas2024/ |
External URL | https://www.ifaamas.org/Proceedings/aamas2024/pdfs/p2153.pdf |
Files
Published Conference Paper
(940 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Version
Extended Abstract
You might also like
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Computing weighted subset odd cycle transversals in H-free graphs
(2022)
Journal Article
Computing subset transversals in H-free graphs
(2021)
Journal Article
What graphs are 2-dot product graphs?
(2021)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search