25 citations · 53 across the 7 of their papers we have counts for
7 papers
Voting with Random Classifiers (VORACE): Theoretical and Experimental Analysis
Cristina Cornelio, Michele Donini, Andrea Loreggia +2
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…
Stable marriage problems with quantitative preferences
Maria Silvia Pini, Francesca Rossi, Brent Venable +1
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…
Local search for stable marriage problems
M. Gelain, M. S. Pini, F. Rossi +2
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general…
Local search for stable marriage problems with ties and incomplete lists
Mirco Gelain, Maria Silvia Pini, Francesca RossI +2
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…
Elicitation strategies for fuzzy constraint problems with missing preferences: algorithms and experimental studies
Mirco Gelain, Maria Pini, Francesca Rossi +2
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.…
Dealing with incomplete agents' preferences and an uncertain agenda in group decision making via sequential majority voting
Maria Pini, Francesca Rossi, Brent Venable +1
We consider multi-agent systems where agents' preferences are aggregated via sequential majority voting: each decision is taken by performing a sequence of pairwise comparisons whe…