In many interactive decision making scenarios there is often no solution that satisfies all of the user’s preferences. The decision process can be helped by providing explanations. Relaxations show sets of consistent preferences and, thus, indicate which preferences can be enforced, while exclusion sets show which preferences can be relaxed to obtain a solution. We propose a new approach to exp...

We study a model in which voters choose between two candidates on the basis of both ideology and competence. While the ideology of the candidates is commonly known, voters are imperfectly informed about competence. Voter preferences, however, are such that it is a dominant strategy to vote according to ideology alone. When voting is compulsory, the candidate of the majority ideology prevails an...

We prove that a universal preference type space exists under much more general conditions than those postulated by Epstein and Wang (1996). To wit, it is enough that preferences can be encoded by a countable collection of continuous functionals, while the preferences themselves need not necessarily be continuous or regular, like, e.g., in the case of lexicographic preferences. The proof relies ...

Social choice theory is concerned with problems of getting from information on individual reports over alternative states of the world to an acceptable means for making a collective decision over these alternatives. These problems were originally studied in the combinatorical framework provided by Arrow type impossibility theorems. More recently Chichilnisky and others have studied the problem ...

Social choice functions choose the ‘best’ outcome corresponding to each profile of individual preferences. Implementing a given social choice function is to make sure that the relationship it establishes between individual preferences and ‘best’ outcomes always holds. One possible way of implementing a given rule is to first ascertain what individual preferences are, and then find their image. ...

In this paper, we present modified fuzzy goal programming (FGP) approach and generalized MATLAB program for solving multi-level linear fractional programming problems (ML-LFPPs) based on with some major modifications in earlier FGP algorithms. In proposed modified FGP approach, solution preferences by the decision makers at each level are not considered and fuzzy goal for the decision vectors i...