This paper is devoted to the study of how to extend a dichotomous partition of a universal set X into good and bad objects to an ordering on the power set of X. We introduce a family of rules that naturally take into account the number of good objects and the number of bad objects, and provide axiomatic characterizations of two rules that are particularly appealing when it comes to compating sets in which the goodR. Arlegi gratefully acknowledges financial support from the Spanish Ministry of Education, projects ECO2012-34202 and ECO2015-65031-R
We consider the problem of ranking sets of objects, the members of which are mutually compatible.Ass...
We consider the problem of ranking sets of objects, the members of which are mutually compatible. As...
We deal with the problem of how to extend a preference relation over a setX of “objects” to th...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
We consider the problem of ranking sets of objects, the members of which are mutually compatible. As...
If a decision maker prefers x to y to z, would he choose orderd set [x;z] or [y;x]? This article stu...
This thesis investigates the problem of extending a (complete) order over a set to its power set. We...
We deal with the problem of how to extend a preference relation over a set X of “objects” to the se...
If a decision maker prefers x to y to z, would he choose orderd set [x;z] or [y;x]? This article stu...
If a decision maker prefers x to y to z, would he choose orderd set [x;z] or [y;x]? This article stu...
We consider the problem of ranking sets of objects, the members of which are mutually compatible.Ass...
We consider the problem of ranking sets of objects, the members of which are mutually compatible. As...
We deal with the problem of how to extend a preference relation over a setX of “objects” to th...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
This paper is devoted to the study of how to extend a dichotomous partition of a universal set X int...
We consider the problem of ranking sets of objects, the members of which are mutually compatible. As...
If a decision maker prefers x to y to z, would he choose orderd set [x;z] or [y;x]? This article stu...
This thesis investigates the problem of extending a (complete) order over a set to its power set. We...
We deal with the problem of how to extend a preference relation over a set X of “objects” to the se...
If a decision maker prefers x to y to z, would he choose orderd set [x;z] or [y;x]? This article stu...
If a decision maker prefers x to y to z, would he choose orderd set [x;z] or [y;x]? This article stu...
We consider the problem of ranking sets of objects, the members of which are mutually compatible.Ass...
We consider the problem of ranking sets of objects, the members of which are mutually compatible. As...
We deal with the problem of how to extend a preference relation over a setX of “objects” to th...