This paper discusses how to improve the identification of the preference of a decision maker (DM) with limited attention proposed by Masatlioglu, Nakajima, and Ozbay (2012). Their identification method relies on choice reversals so the obtained revealed preference is often very incomplete. We propose three approaches to address this problem. The first one is accommodating to a model-free approa...

One of the key tasks in data mining and information retrieval is to learn preference relations between objects. Approaches reported in the literature mainly aim at learning preference relations between objects represented according to the classical attribute-value representation. However, the growing interest in data mining techniques able to directly mine data represented according to more sop...

This paper studies strict preference relations on product sets induced by “ordinal aggregation methods”. Such methods are interpreted here as performing paired comparisons of alternatives based on the “importance” of attributes favoring each element of the pair: alternative x will be preferred to alternative y if the attributes for which x is better than y are “more important” than the attribut...

This article develops a group decision framework with intuitionistic preference relations. An approach is first devised to rectify an inconsistent intuitionistic preference relation to derive an additive consistent one. A new aggregation operator, the so-called induced intuitionistic ordered weighted averaging (IIOWA) operator, is proposed to aggregate individual intuitionistic fuzzy judgments....

We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference ordering may be incomplete because, for example, there is an ongoing preference elicitation process. It may also contain incomparability, which can be useful, for example, in multi-criteria scenarios. We focus on the proble...

The incomplete data is universal in many real-life applications due to data integration, the limitation of devices, etc. In this demonstration, we present SI2P, a restaurant recommendation System with Preference queries on Incomplete Information. SI2P is capable of friendly recommending desirable restaurants based on preference queries that take the incomplete ratings information into considera...

We explore the notion of duality for defeasible entailment relations induced by preference orderings on states. We then show that such preferential entailment relations may be used to characterise Peircean inductive and abductive reasoning. Interpreting the preference relations as accessibility relations establishes modular Gödel-Löb logic as the modal logic of inductive and abductive reasoning. §

A multiperson decision making problem, where the information about the alternatives provided by the experts can be presented by means of diierent preference representation structures (preference orderings, utility functions and multiplicative preference relations) is studied. Assuming the multiplicative preference relation as the uniform element of the preference representation, a multiplicativ...

I characterize the class of (possibly incomplete) preference relations over lotteries which can be represented by a compact set of (continuous) expected utility functions that preserve both indifferences and strict preferences. This finding contrasts with the representation theorem of Dubra, Maccheroni and Ok (2004) which typically delivers some functions which do not respect strict preferences...

We characterize the class of (possibly incomplete) preference relations over lotteries that can be represented by a compact set of (continuous) expected utility functions which preserve both indifferences and strict preferences. This finding contrasts with the representation theorem of Dubra, Maccheroni and Ok (2004) which either delivers a noncompact set of utility functions, or at least one f...