Archived
This content is available here strictly for research, reference, and/or recordkeeping and as such it may not be fully accessible. If you work or study at University of Kentucky and would like to request an accessible version, please use the SensusAccess Document Converter.
Date Available
3-23-2023
Year of Publication
2023
Document Type
Doctoral Dissertation
Degree Name
Doctor of Philosophy (PhD)
College
Engineering
Department/School/Program
Computer Science
Faculty
Dr. Judith Goldsmith
Faculty
Dr. Simone Silvestri
Abstract
We present and empirically characterize a general, parallel, heuristic algorithm for computing small ε-Pareto sets. The algorithm can be used as part of a decision support tool for settings in which computing points in objective space is computationally expensive. We use the graph clearing problem, a formalization of indirect organ exchange markets, as a prototypical example setting. We characterize the performance of the algorithm through ε-Pareto set size, ε value provided, and parallel speedup achieved. Our results show that the algorithm's combination of parallel speedup and small ε-Pareto sets is sufficient to be appealing in settings requiring manual review (i.e., those that have a human in the loop) and real-time solutions.
Digital Object Identifier (DOI)
https://doi.org/10.13023/etd.2023.042
Recommended Citation
Bailey, William, "Small Approximate Pareto Sets with Quality Bounds" (2023). Theses and Dissertations--Computer Science. 127.
https://uknowledge.uky.edu/cs_etds/127
