-
Article
Open AccessVoting with random classifiers (VORACE): theoretical and experimental analysis
In many machine learning scenarios, looking for the best classifier that fits a particular dataset can be very costly in terms of time and resources. Moreover, it can require deep knowledge of the specific dom...
-
Article
Multi-agent soft constraint aggregation via sequential voting: theoretical and experimental results
We consider scenarios where several agents must aggregate their preferences over a large set of candidates with a combinatorial structure. That is, each candidate is an element of the Cartesian product of the ...
-
Chapter and Conference Paper
Constructing CP-Nets from Users Past Selection
Although recommender systems have been significantly developed for providing customized services to users in various domains, they still have some limitations regarding the extraction of users’ conditional pre...
-
Chapter and Conference Paper
Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems: Theoretical and Experimental Studies
The stable matching problem has many practical applications in two-sided markets, like those that assign doctors to hospitals or students to schools. Usually it is assumed that all agents in each side explicit...
-
Chapter and Conference Paper
Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems
We define a framework for stable matching problems where agents are allowed to express their preferences in a compact way, via fuzzy constraints over the features describing the agents of the other group. We p...
-
Chapter and Conference Paper
A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems
We consider soft constraint problems where some of the preferences may be unspecified. In practice, some preferences may be missing when there is, for example, a high cost for computing the preference values, ...
-
Chapter and Conference Paper
A Tag-Based Recommender System
Recommender systems are being used more and more on the web thanks to their ability to predict user preferences and drive user attention new items, increasing sales, and engagement. However, the use of such ...
-
Chapter and Conference Paper
A Self-Adaptive Context-Aware Group Recommender System
The importance role of contextual information on users’ daily decisions led to develop the new generation of recommender systems called Context-Aware Recommender Systems (CARSs). Dependency of users preference...
-
Chapter
A Design of Context-Aware Framework for Conditional Preferences of Group of Users
Due to the dependency of users’ preferences, which change over time, there is a need to generate a recommender framework that can handle users’ conditional preferences. Since the most existing context-aware fr...
-
Article
Bribery in voting with CP-nets
We investigate the computational complexity of finding optimal bribery schemes in voting domains where the candidate set is the Cartesian product of a set of variables and voters use CP-nets, an expressive and...
-
Chapter and Conference Paper
Stability and Optimality in Matching Problems with Weighted Preferences
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practical ...
-
Chapter and Conference Paper
Combining Recommender and Reputation Systems to Produce Better Online Advice
Although recommender systems and reputation systems have quite different theoretical and technical bases, both types of systems have the purpose of providing advice for decision making in e-commerce and online...
-
Article
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider the use of voting tree rules t...
-
Chapter and Conference Paper
Male Optimal and Unique Stable Marriages with Partially Ordered Preferences
The stable marriage problem has a wide variety of practical applications, including matching resident doctors to hospitals, and students to schools. In the classical stable marriage problem, both men and women...
-
Article
Manipulation complexity and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a wide variety of practical ap...
-
Article
Interval-valued soft constraint problems
Constraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference values, and it is much more r...
-
Chapter and Conference Paper
Local Search for Stable Marriage Problems with Ties and Incomplete Lists
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to any two-sided market. We con...
-
Chapter and Conference Paper
Robust Solutions in Unstable Optimization Problems
We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. We also allow for some uncont...
-
Chapter and Conference Paper
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. We consider here fuzzy constr...
-
Chapter and Conference Paper
Uncertainty in Bipolar Preference Problems
Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However, some information is provided...
