Zobrazeno 1 - 10
of 82
pro vyhledávání: '"David F. Manlove"'
Autor:
Péter Biró, David F. Manlove
Publikováno v:
Algorithms, Vol 7, Iss 2, Pp 203-205 (2014)
This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexity.
Externí odkaz:
https://doaj.org/article/aa0e833d3a0a4fcabb5d0e29f7b48f8e
Publikováno v:
Discrete Applied Mathematics. 308:220-234
We study the Student-Project Allocation problem with lecturer preferences over Projects ( spa-p ). In this context it is known that stable matchings can have different sizes and the problem of finding a maximum size stable matching is NP-hard. There
Autor:
Maxence Delorme, Sergio García, William Pettersson, Jacek Gondzio, Joerg Kalcsics, David F. Manlove
Publikováno v:
Omega (United Kingdom), 103:102386. PERGAMON-ELSEVIER SCIENCE LTD
Delorme, M, Garcia, S, Gondzio, J, Kalcsics, J, Manlove, D & Pettersson, W 2020, ' Stability in the Hospitals / Residents problem with Couples and Ties: Mathematical models and computational studies ', Omega . https://doi.org/10.1016/j.omega.2020.102386
Delorme, M, Garcia, S, Gondzio, J, Kalcsics, J, Manlove, D & Pettersson, W 2020, ' Stability in the Hospitals / Residents problem with Couples and Ties: Mathematical models and computational studies ', Omega . https://doi.org/10.1016/j.omega.2020.102386
In the well-known Hospitals/Residents problem (HR), the objective is to find a stable matching of doctors (or residents) to hospitals based on their preference lists. In this paper, we study HRCT, the extension of HR in which doctors are allowed to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0cf299cb705552be2976de8c3064f37
https://research.tilburguniversity.edu/en/publications/981fd8ee-79cf-43be-9162-52ef9d9458a9
https://research.tilburguniversity.edu/en/publications/981fd8ee-79cf-43be-9162-52ef9d9458a9
We study the problem of finding a minimal edge dominating set of maximum size in a given graph G = ( V , E ) , called Upper EDS . We show that this problem is not approximable within a ratio of n e − 1 2 , for any e ∈ ( 0 , 1 2 ) , assuming P ≠
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6e5077d0b254af42834393d0e7a5f41
https://eprints.gla.ac.uk/237671/1/237671.pdf
https://eprints.gla.ac.uk/237671/1/237671.pdf
Autor:
Alessandro Nanni Costa, Pavel Chromy, Lisa Burnapp, Dirk Kuypers, David F. Manlove, Xenia Klimentova, Bart Smeulders, Tommy Andersson, Pablo Delgado, Rachel J. Johnson, María O. Valentín, William Pettersson, Joris van de Klundert, Bernadette Haase, Piotr Dworczak, Ana Luiza d'Ávila Viana, Frits C. R. Spieksma, Aline C. Hemke, Péter Biró
Publikováno v:
European Journal of Operational Research, 291(2), 447-456. Elsevier
The complex multi-criteria optimisation problems arising in Kidney Exchange Programmes have received considerable attention both in practice and in the scientific literature. Whereas theoretical advancements are well reviewed and synthesised, this is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f49a376c0cb364ec714fdc222135eed
https://eprints.gla.ac.uk/194715/1/194715.pdf
https://eprints.gla.ac.uk/194715/1/194715.pdf
Publikováno v:
Proceedings of the fifteenth ACM conference on Economics and computation-EC '14
EC '14: Proceedings of the fifteenth ACM conference on Economics and computatio
Algorithmica: an international journal in computer science
EC
EC '14: Proceedings of the fifteenth ACM conference on Economics and computatio
Algorithmica: an international journal in computer science
EC
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects. We
Autor:
Tommy Andersson, Paolo Ferrari, William Pettersson, Aline C. Hemke, María O. Valentín, Margherita Gentile, Antonij Slavcev, Pavel Chromy, Paolo Tubertini, Matthew Robb, Catarina Bolotinha, Joris van de Klundert, Karine Hadaya, Ana Luiza d'Ávila Viana, David F. Manlove, Dirk Kuypers, Bart Smeulders, Xenia Klimentova
Publikováno v:
Health Informatics Journal, 27(2), 1-15. SAGE Publications Ltd
Kidney Exchange Programs (KEP) are valuable tools to increase the options of living donor kidney transplantation for patients with end-stage kidney disease with an immunologically incompatible live donor. Maximising the benefits of a KEP requires an
The Stable Roommates problem (SR) is characterized by the preferences of agents over other agents as roommates: each agent ranks all others in strict order of preference. A solution to SR is then a partition of the agents into pairs so that each pair
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9dc7db295d9cf9eb954e54abda65c6fe
https://eprints.gla.ac.uk/221680/7/221680.pdf
https://eprints.gla.ac.uk/221680/7/221680.pdf
Autor:
Sergio García, David F. Manlove, William Pettersson, Maxence Delorme, Jacek Gondzio, Jörg Kalcsics
Publikováno v:
Petterssona, W, Delorme, M, Garcia, S, Gondzio, J, Kalcsics, J & Manlove, D 2020, ' Improving solution times for stable matching problems through preprocessing ', Computers and Operations Research . https://doi.org/10.1016/j.cor.2020.105128
We present new theory, heuristics, and algorithms for preprocessing instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and the Hospitals/Residents problem with Ties (HRT). Instances of these problems can be preprocessed by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76d90ede124c8f7a6ff835bdf99b155e
https://www.pure.ed.ac.uk/ws/files/173676687/AuthorFinal.pdf
https://www.pure.ed.ac.uk/ws/files/173676687/AuthorFinal.pdf
Autor:
Sofiat Olaosebikan, David F. Manlove
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
We study a variant of the Student-Project Allocation problem with lecturer preferences over Students where ties are allowed in the preference lists of students and lecturers (spa-st). We investigate the concept of strong stability in this context. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b248926007605f7b89e16d484f367bd
https://doi.org/10.1007/978-3-030-39219-2_31
https://doi.org/10.1007/978-3-030-39219-2_31