模糊选择函数中一些显示偏好关系的研究

对普通选择函数所导出的偏好关系R*,R,R,■及其之间的联系进行了讨论,并以此为基础,深入研究了模糊情况下对应的偏好关系及其之间的联系,给出了它们相等的一些充要条件。     

On Groups with Finitely Many Conradian Orderings

We study the space of left-orderings on groups with (only) finitely many Conradian orderings. We show that, within this class of groups, having an isolated left-ordering is equivalent to having finitely many left-orderings.     

Orderings and Probability Functionals Consistent with Preferences

This paper unifies the classical theory of stochastic dominance and investor preferences with the recent literature on risk measures applied to the choice problem faced by investors. First, we summarize the main stochastic dominance rules used in the finance literature. Then we discuss the connection with the theory of integral stochastic orders and we introduce orderings consistent with investors' preferences. Thus, we classify them, distinguishing several categories of orderings associated with different classes of investors. Finally, we show how we can use risk measures and orderings consistent with some preferences to determine the investors' optimal choices.     

Birnbaum‐Saunders distribution: A review of models,analysis, and applications

Birnbaum and Saunders introduced a two‐parameter lifetime distribution to model the fatigue life of a metal, subject to cyclic stress. Since then, extensive work has been done on this model providing different interpretations, constructions, generalizations, inferential methods, and extensions to bivariate, multivariate, and matrix‐variate cases. More than 200 papers and one research monograph have already appeared describing all these aspects and developments. In this paper, we provide a detailed review of all these developments and, at the same time, indicate several open problems that could be considered for further research.     

Measurement of preferences with self-explicated approaches: A classification and merge of trade-off- and non-trade-off-based evaluation types

Self-explicated approaches are popular preference measurement approaches for products with many attributes. This article classifies previous self-explicated approaches according to their evaluation types, i.e. trade-off- versus non-trade-off-based, and outlines their advantages and disadvantages. In addition, it proposes a new method, the presorted adaptive self-explicated approach that is based on Netzer and Srinivasan’s (2011) adaptive self-explicated approach and that combines trade-off- and non-trade-off-based evaluation types. Two empirical studies compare this new method with the most popular existing self-explicated approaches, including the adaptive self-explicated approach and paired comparison preference measurement. The new method overcomes the insufficient discrimination between importance weights, as usually found in non-trade-off-based evaluation types; discourages respondents’ simplification strategies, as are frequently encountered in trade-off evaluation types; is easy to implement; and yields high predictive validity compared with other popular self-explicated approaches.     

On 3-Steiner simplicial orderings

Let G be a connected graph and S a nonempty set of vertices of G. A Steiner tree for S is a connected subgraph of G containing S that has a minimum number of edges. The Steiner interval for S is the collection of all vertices in G that belong to some Steiner tree for S. Let k≥2 be an integer. A set X of vertices of G is k-Steiner convex if it contains the Steiner interval of every set of k vertices in X. A vertex x∈X is an extreme vertex of X if X?{x} is also k-Steiner convex. We call such vertices k-Steiner simplicial vertices. We characterize vertices that are 3-Steiner simplicial and give characterizations of two classes of graphs, namely the class of graphs for which every ordering produced by Lexicographic Breadth First Search is a 3-Steiner simplicial ordering and the class for which every ordering of every induced subgraph produced by Maximum Cardinality Search is a 3-Steiner simplicial ordering.     

How people make friends in social networking sites—A microscopic perspective

We study the detailed growth of a social networking site with full temporal information by examining the creation process of each friendship relation that can collectively lead to the macroscopic properties of the network. We first study the reciprocal behavior of users, and find that link requests are quickly responded to and that the distribution of reciprocation intervals decays in an exponential form. The degrees of inviters/accepters are slightly negatively correlative with reciprocation time. In addition, the temporal feature of the online community shows that the distributions of intervals of user behaviors, such as sending or accepting link requests, follow a power law with a universal exponent, and peaks emerge for intervals of an integral day. We finally study the preferential selection and linking phenomena of the social networking site and find that, for the former, a linear preference holds for preferential sending and reception, and for the latter, a linear preference also holds for preferential acceptance, creation, and attachment. Based on the linearly preferential linking, we put forward an analyzable network model which can reproduce the degree distribution of the network. The research framework presented in the paper could provide a potential insight into how the micro-motives of users lead to the global structure of online social networks.     

Effects of imprecise weighting in hierarchical preference programming

Preference programming is a general term for multi-criteria decision analytical approaches allowing incomplete preference information. In the PAIRS method, interval judgments are assigned to weight ratios between attributes to model imprecision in multi-attribute value trees. This paper studies the effects of a hierarchical model structure on the overall imprecision, as the form of the hierarchy also affects the form of imprecision that can be assigned to the model. The aim is to find out good procedural practices for reducing overall imprecision descending inherently from the model structure. The study provides simulation results about the ability of various weighting schemes to identify dominated alternatives, which are discussed with respect to other issues related to the weighting process. According to the results, a hierarchical model is structurally somewhat more unable to identify dominances than a corresponding nonhierarchical model, but its cognitive advantages often cancel out this. The results also suggest paying reasonable attention to the precision of the lower level judgments and to identifying possible correlations between the criteria.     

When conflict induces the expression of incomplete preferences

Multicriteria conflict arises in pairwise comparisons, where each alternative outperforms the other one on some criterion, which imposes a trade-off. Comparing two alternatives can be difficult if their respective advantages are of high magnitude (the attribute spread is large). In this paper, we investigate to which extent conflict in a comparison situation can lead decision makers to express incomplete preferences, that is, to refuse to compare the two alternatives, or to be unable to compare them with confidence. We report on an experiment in which subjects expressed preferences on pairs of alternatives involving varying conflicts. Results show that depending on whether the participants are allowed to express incomplete preferences or not, attribute spread has a different effect: a large attribute spread increases the frequency of incomparability statements, when available, while it increases the use of indifference statements when only indifference and preference answers are permitted. These results lead us to derive some implications for preference elicitation methods involving comparison tasks.     

关于模糊严格偏好关系的传递性

给定一个模糊关系,Ovchinnikov和Roubens引进了非常一般的模糊严格偏好关系定义,本文将详细讨论该偏好关系的弱传递性,一致性,强传递性以及非循环性等传递性有关的性质。