Finding optimal alternatives based on efficient comparative preference inference

Choosing the right or the best option is often a demanding and challenging task for the user (e.g., a customer in an online retailer) when there are many available alternatives. In fact, the user rarely knows which offering will provide the highest value. To reduce the complexity of the choice process, automated recommender systems generate personalized recommendations. These recommendations take into account the preferences collected from the user in an explicit (e.g., letting users express their opinion about items) or implicit (e.g., studying some behavioral features) way. Such systems are widespread; research indicates that they increase the customers' satisfaction and lead to higher sales. Preference handling is one of the core issues in the design of every recommender system. This kind of system often aims at guiding users in a personalized way to interesting or useful options in a large space of possible options. Therefore, it is important for them to catch and model the user's preferences as accurately as possible. In this thesis, we develop a comparative preference-based user model to represent the user's preferences in conversational recommender systems. This type of user model allows the recommender system to capture several preference nuances from the user's feedback. We show that, when applied to conversational recommender systems, the comparative preference-based model is able to guide the user towards the best option while the system is interacting with her. We empirically test and validate the suitability and the practical computational aspects of the comparative preference-based user model and the related preference relations by comparing them to a sum of weights-based user model and the related preference relations. Product configuration, scheduling a meeting and the construction of autonomous agents are among several artificial intelligence tasks that involve a process of constrained optimization, that is, optimization of behavior or options subject to given constraints with regards to a set of preferences. When solving a constrained optimization problem, pruning techniques, such as the branch and bound technique, point at directing the search towards the best assignments, thus allowing the bounding functions to prune more branches in the search tree. Several constrained optimization problems may exhibit dominance relations. These dominance relations can be particularly useful in constrained optimization problems as they can instigate new ways (rules) of pruning non optimal solutions. Such pruning methods can achieve dramatic reductions in the search space while looking for optimal solutions. A number of constrained optimization problems can model the user's preferences using the comparative preferences. In this thesis, we develop a set of pruning rules used in the branch and bound technique to efficiently solve this kind of optimization problem. More specifically, we show how to generate newly defined pruning rules from a dominance algorithm that refers to a set of comparative preferences. These rules include pruning approaches (and combinations of them) which can drastically prune the search space. They mainly reduce the number of (expensive) pairwise comparisons performed during the search while guiding constrained optimization algorithms to find optimal solutions. Our experimental results show that the pruning rules that we have developed and their different combinations have varying impact on the performance of the branch and bound technique.

CloudNeg: An autonomous multi issue negotiation system, with preference elicitation component, for trading cloud services

Cloud services provide its users with flexible resource provisioning. But in the current market, a user has to choose from a limited set of configurations at a fixed price. This paper presents an autonomous negotiation system termed CloudNeg for negotiating cloud services. CloudNeg provides buyers and sellers of cloud services with autonomous agents to negotiate on the specifications of a cloud instance, including price, on their behalf. These agents elicit their buyers’ time preferences and use them in negotiations. Further, this paper presents two artifacts: a negotiation algorithm and a prototype which together form CloudNeg.

Valuing maternity care: a comparison of stated preference methods with an application to cost-benefit analysis

This research investigates whether a reconfiguration of maternity services, which collocates consultant- and midwifery-led care, reflects demand and value for money in Ireland. Qualitative and quantitative research is undertaken to investigate demand and an economic evaluation is performed to evaluate the costs and benefits of the different models of care. Qualitative research is undertaken to identify women’s motivations when choosing place of delivery. These data are further used to inform two stated preference techniques: a discrete choice experiment (DCE) and contingent valuation method (CVM). These are employed to identify women’s strengths of preferences for different features of care (DCE) and estimate women’s willingness to pay for maternity care (CVM), which is used to inform a cost-benefit analysis (CBA) on consultant- and midwifery-led care. The qualitative research suggests women do not have a clear preference for consultant or midwifery-led care, but rather a hybrid model of care which closely resembles the Domiciliary Care In and Out of Hospital (DOMINO) scheme. Women’s primary concern during care is safety, meaning women would only utilise midwifery-led care when co-located with consultant-led care. The DCE also finds women’s preferred package of care closely mirrors the DOMINO scheme with 39% of women expected to utilise this service. Consultant- and midwifery-led care would then be utilised by 34% and 27% of women, respectively. The CVM supports this hierarchy of preferences where consultant-led care is consistently valued more than midwifery-led care – women are willing to pay €956.03 for consultant-led care and €808.33 for midwifery-led care. A package of care for a woman availing of consultant- and midwifery-led care is estimated to cost €1,102.72 and €682.49, respectively. The CBA suggests both models of care are cost-beneficial and should be pursued in Ireland. This reconfiguration of maternity services would maximise women’s utility, while fulfilling important objectives of key government policy.

Preference inference based on Pareto models

In this paper, we consider Preference Inference based on a generalised form of Pareto order. Preference Inference aims at reasoning over an incomplete specification of user preferences. We focus on two problems. The Preference Deduction Problem (PDP) asks if another preference statement can be deduced (with certainty) from a set of given preference statements. The Preference Consistency Problem (PCP) asks if a set of given preference statements is consistent, i.e., the statements are not contradicting each other. Here, preference statements are direct comparisons between alternatives (strict and non-strict). It is assumed that a set of evaluation functions is known by which all alternatives can be rated. We consider Pareto models which induce order relations on the set of alternatives in a Pareto manner, i.e., one alternative is preferred to another only if it is preferred on every component of the model. We describe characterisations for deduction and consistency based on an analysis of the set of evaluation functions, and present algorithmic solutions and complexity results for PDP and PCP, based on Pareto models in general and for a special case. Furthermore, a comparison shows that the inference based on Pareto models is less cautious than some other types of well-known preference model.