Reasoning with sorted-pareto dominance and other qualitative and partially ordered preferences in soft constraints

Simple item page
dc.check.embargoformatNot applicableen
dc.check.infoNo embargo requireden
dc.check.opt-outNot applicableen
dc.check.reasonNo embargo requireden
dc.check.typeNo Embargo Required
dc.contributor.advisorWilson, Nicen
dc.contributor.advisorO'Sullivan, Barryen
dc.contributor.authorO'Mahony, Conor
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2014-03-31T14:55:21Z
dc.date.available2014-03-31T14:55:21Z
dc.date.issued2013
dc.date.submitted2013
dc.description.abstractIn decision making problems where we need to choose a particular decision or alternative from a set of possible choices, we often have some preferences which determine if we prefer one decision over another. When these preferences give us an ordering on the decisions that is complete, then it is easy to choose the best or one of the best decisions. However it often occurs that the preferences relation is partially ordered, and we have no best decision. In this thesis, we look at what happens when we have such a partial order over a set of decisions, in particular when we have multiple orderings on a set of decisions, and we present a framework for qualitative decision making. We look at the different natural notions of optimal decision that occur in this framework, which gives us different optimality classes, and we examine the relationships between these classes. We then look in particular at a qualitative preference relation called Sorted-Pareto Dominance, which is an extension of Pareto Dominance, and we give a semantics for this relation as one that is compatible with any order-preserving mapping of an ordinal preference scale to a numerical one. We apply Sorted-Pareto dominance to a Soft Constraints setting, where we solve problems in which the soft constraints associate qualitative preferences to decisions in a decision problem. We also examine the Sorted-Pareto dominance relation in the context of our qualitative decision making framework, looking at the relevant optimality classes for the Sorted-Pareto case, which gives us classes of decisions that are necessarily optimal, and optimal for some choice of mapping of an ordinal scale to a quantitative one. We provide some empirical analysis of Sorted-Pareto constraints problems and examine the optimality classes that result.en
dc.description.sponsorshipScience Foundation Ireland (Grant 08/PI/I1912)en
dc.description.statusNot peer revieweden
dc.description.versionAccepted Version
dc.format.mimetypeapplication/pdfen
dc.identifier.citationO'Mahony, C. 2013. Reasoning with sorted-pareto dominance and other qualitative and partially ordered preferences in soft constraints. PhD Thesis, University College Cork.en
dc.identifier.endpage188
dc.identifier.urihttps://hdl.handle.net/10468/1498
dc.language.isoenen
dc.publisherUniversity College Corken
dc.rights© 2013, Conor O'Mahonyen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/en
dc.subjectSorted-Pareto Dominanceen
dc.subjectPartially ordered preferencesen
dc.subjectSoft constraintsen
dc.subjectQualitative preferencesen
dc.subject.lcshConstraint programming (Computer science)en
dc.thesis.opt-outfalse
dc.titleReasoning with sorted-pareto dominance and other qualitative and partially ordered preferences in soft constraintsen
dc.typeDoctoral thesisen
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnamePhD (Science)en
ucc.workflow.supervisorn.wilson@4c.ucc.ie
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
OMahonyCS_PhD2014.pdf
Size:
2.13 MB
Format:
Adobe Portable Document Format
Description:
Full Text E-Thesis
Download
Thumbnail Image
Name:
abstract.pdf
Size:
30.27 KB
Format:
Adobe Portable Document Format
Description:
Abstract
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
5.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Doctoral Theses
College of Science, Engineering and Food Science - Doctoral Theses
Computer Science - Doctoral Theses