Lexicographic Tradeoff Structures
نویسنده
چکیده
In selecting a house from a limited domain of houses, price dominates one's considerations when the difference in price between two houses is sufficiently large. But when the two prices are sufficiently close, other factors begin to enter into consideration. We do not ignore price it is hardly possible to pay no attention to the difference between $49,500 and $55,000 but we begin to acknowledge that such a difference can be compensated for by factors such as location, style, lot size, spaciousness, etc. Examples such as this exhibit three main features, two of which do not seem to be jointly captured in any of our existing decision models. First, the choice situation can be described as a conjoint structure with at least two factors affecting the decision attribute. Second, one factor, call it the first, is most important in the sense that for sufficiently large differences on that factor it is totally controlling. Third, when, however, the difference on the first factor is not too large, the second factor, and others if they exist, come into play and tradeoffs exist between the two factors, as in the usual theories of conjoint measurement. Tversky (1969) discussed this problem. He pointed out that, to a degree, the behavior is captured by a lexicographic semiorder: a structure that is lexicographic in the sense that control shifts to the second component when indifference exists on the first; however indifference is assumed to be nontransitive and, in fact, to arise from a semiorder (see below). As Tversky notes on p. 40, " ... despite its intuitive appeal, it is based on a noncompensatory principle that is likely to be too restrictive in many contexts." He then goes on to suggest an additive difference representation where there are functions ~b i assigned to the n components X i and increasing weighting functions f / such that x is prefererred or indifferent to y if and only if n i ~1 ~ [r r % ) ] > 0, where j~ ( 6) = -~j~ (6). This, however, does not capture very well the lexicographic character of some choices.
منابع مشابه
On generalized trade-off directions for basic optimality principles in convex and noncon- vex multiobjective optimization
We consider a general multiobjective optimization problem with five basic optimality principles: efficiency, weak and proper Pareto optimality, strong efficiency and lexicographic optimality. We generalize the concept of tradeoff directions defining them as some optimal surface of appropriate cones. In convex optimization, the contingent cone can be used for all optimality principles except lex...
متن کاملRepresentation and Inference of Lexicographic Preference Models and Their Variants
T authors propose two variants of lexicographic preference rules. They obtain the necessary and sufficient conditions under which a linear utility function represents a standard lexicographic rule, and each of the proposed variants, over a set of discrete attributes. They then: (i) characterize the measurement properties of the parameters in the representations; (ii) propose a nonmetric procedu...
متن کاملPartial Valuation Structures for Qualitative Soft Constraints
Soft constraints have proved to be a versatile tool for the specification and implementation of decision making in adaptive systems. A plethora of formalisms have been devised to capture different notions of preference. Wirsing et al. have proposed partial valuation structures as a unifying algebraic structure for several soft constraint formalisms, including quantitative and qualitative ones, ...
متن کاملA Conditional Lexicographic Approach for the Elicitation of QoS Preferences
In a service-oriented environment, clients can usually choose between several web services offering the same functionality. The web service selection can be automated by allowing clients to specify nonfunctional requirements such as quality of service. Clients should also be able to indicate how to make tradeoffs when some of these requirements cannot be met. The ability to capture tradeoff pre...
متن کاملUsing lexicographic parametric programming for identifying efficient hyperpalnes in DEA
This paper investigates a procedure for identifying all efficient hyperplanes of production possibility set (PPS). This procedure is based on a method which recommended by Pekka J. Korhonen[8]. He offered using of lexicographic parametric programming method for recognizing all efficient units in data envelopment analysis (DEA). In this paper we can find efficient hyperplanes, via using the para...
متن کامل