On the moments and distribution of discrete Choquet integrals from continuous distributions

We study the moments and the distribution of the discrete Choquet integral when regarded as a real function of a random sample drawn from a continuous distribution. Since the discrete Choquet integral includes weighted arithmetic means, ordered weighted averaging functions, and lattice polynomial functions as particular cases, our results encompass the corresponding results for these aggregation functions. After detailing the results obtained in [J.-L. Marichal, I. Kojadinovic, Distribution functions of linear combinations of lattice polynomials from the uniform distribution, Statistics & Probability Letters 78 (2008) 985–991] in the uniform case, we present results for the standard exponential case, show how approximations of the moments can be obtained for other continuous distributions such as the standard normal, and elaborate on the asymptotic distribution of the Choquet integral. The results presented in this work can be used to improve the interpretation of discrete Choquet integrals when employed as aggregation functions.     

Learning Weights in the Generalized OWA Operators

This paper discusses identification of parameters of generalized ordered weighted averaging (GOWA) operators from empirical data. Similarly to ordinary OWA operators, GOWA are characterized by a vector of weights, as well as the power to which the arguments are raised. We develop optimization techniques which allow one to fit such operators to the observed data. We also generalize these methods for functional defined GOWA and generalized Choquet integral based aggregation operators.     

Development of some linguistic aggregation operators with conservation of interaction between criteria and their application in multiple attribute group decision problems

Decision making problems with fuzzy linguistic information and Choquet integral is investigated in this paper, to introduce three new aggregation operators: 2-tuple choquet integral averaging operator (TCIA), 2-tuple ordered choquet integral averaging operator (TOCIA) and combined 2-tuple choquet integral averaging operator which can be used to aggregate preference information that takes not only the form of linguistic variables but also study some of its desirable properties. Also, we developed a practical method based on TCIA as well as TOCIA operators for multiple attribute group decision making. Furthermore, in this approach alternative assessments are computed by the aggregation of 2-tuple linguistic information. Therefore, ranking alternatives or selecting the most desirable ones will be the outcome of the comparison between the 2-tuple linguistic information. Ultimately, the demonstration of the developed approaches, its practicality and its effectiveness is proved by a numerical example and a comparison with results issued from Wan method (Knowl-Based Syst 45:31–40, 2013).     

Bipolarization of posets and natural interpolation

The Choquet integral w.r.t. a capacity can be seen in the finite case as a parsimonious linear interpolator between vertices of n[0,1]. We take this basic fact as a starting point to define the Choquet integral in a very general way, using the geometric realization of lattices and their natural triangulation, as in the work of Koshevoy.A second aim of the paper is to define a general mechanism for the bipolarization of ordered structures. Bisets (or signed sets), as well as bisubmodular functions, bicapacities, bicooperative games, as well as the Choquet integral defined for them can be seen as particular instances of this scheme.Lastly, an application to multicriteria aggregation with multiple reference levels illustrates all the results presented in the paper.     

Generalized triangular fuzzy correlated averaging operator and their application to multiple attribute decision making

We investigate the multiple attribute decision making problems with triangular fuzzy information. Motivated by the ideal of Choquet integral [G. Choquet, Theory of capacities, Ann. Instit. Fourier 5 (1953) 131–295] and generalized OWA operator [R.R. Yager, Generalized OWA aggregation operators, Fuzzy Optim. Dec. Making 3 (2004) 93–107], in this paper, we have developed an generalized triangular fuzzy correlated averaging (GTFCA) operator. The prominent characteristic of the operators is that they cannot only consider the importance of the elements or their ordered positions, but also reflect the correlation among the elements or their ordered positions. We have applied the GTFCA operator to multiple attribute decision making problems with triangular fuzzy information. Finally an illustrative example has been given to show the developed method.     

Multi-criteria decision-making method based on normal intuitionistic fuzzy-induced generalized aggregation operator

Normal intuitionistic fuzzy numbers (NIFNs), which use normal fuzzy numbers to express their membership and non-membership functions, can reflect the evaluation information exactly in different dimensions. In this paper, we are committed to apply NIFNs to multi-criteria decision-making (MCDM) problems, and meanwhile some new aggregation operators are proposed, including normal intuitionistic fuzzy weighted arithmetic averaging operator, normal intuitionistic fuzzy weighted geometric averaging operator, normal intuitionistic fuzzy-induced ordered weighted averaging operator, normal intuitionistic fuzzy-induced ordered weighted geometric averaging operator and normal intuitionistic fuzzy-induced generalized ordered weighted averaging operator (NIFIGOWA). Based on the NIFIGOWA operator, an approach is introduced to solve MCDM problems where the criteria values are NIFNs and the criteria weight information is fixed. Finally, the proposed method is compared to the existing methods by virtue of a numerical example to verify its feasibility and rationality.     

Continuous interval-valued intuitionistic fuzzy aggregation operators and their applications to group decision making

In this paper, we introduce a new operator called the continuous interval-valued intuitionistic fuzzy ordered weighted averaging (C-IVIFOWA) operator for aggregating the interval-valued intuitionistic fuzzy values. It combines the intuitionistic fuzzy ordered weighted averaging (IFOWA) operator and the continuous ordered weighted averaging (C-OWA) operator by a controlling parameter, which can be employed to diminish fuzziness and improve the accuracy of decision making. We further apply the C-IVIFOWA operator to the aggregation of multiple interval-valued intuitionistic fuzzy values and obtain a wide range of aggregation operators including the weighted C-IVIFOWA (WC-IVIFOWA) operator, the ordered weighted (OWC-IVIFOWA) operator and the combined C-IVIFOWA (CC-IVIFOWA) operator. Some desirable properties of these operators are investigated. And finally, we give a numerical example to illustrate the applications of these operators to group decision making under interval-valued intuitionistic fuzzy environment.     

The orness measures for two compound quasi-arithmetic mean aggregation operators

The paper first summarizes the orness measures and their common characteristics of some averaging operators: the quasi-arithmetic mean, the ordered weighted averaging (OWA) operator, the regular increasing monotone (RIM) quantifier and the weighted function average operator, respectively. Then it focuses on the aggregation properties and operator determination methods for two kinds of quasi-arithmetic mean-based compound aggregation operators: the quasi-OWA (ordered weighted averaging) operator and the Bajraktarevi? mean. The former is the combination of the quasi-arithmetic mean and the OWA operator, while the latter is the combination of the quasi-arithmetic mean and the weighted function average operator. Two quasi-OWA operator forms are given, where the OWA operator is assigned directly or generated from a RIM (regular increasing monotone) quantifier indirectly. The orness indexes to reflect the or-like level of the quasi-OWA operator and Bajraktarevi? mean are proposed. With generating function techniques, the properties of the quasi-OWA operator and Bajraktarevi? mean are discussed to show the rationality of these orness definitions. Based on these properties, two families of parameterized quasi-OWA operator and Bajraktarevi? mean with exponential and power function generators are proposed and compared. It shows that the method of this paper can also be applied to other function-based aggregation operators.     

On the fundamental convergence in the (C) mean in problems of information fusion

The Choquet integral can be regarded as one of aggregation operators being used in information fusion. In this study, we offer an interpretation of sequences of measurable functions and the Choquet integral in the framework of information fusion. Based on an efficiency measure space, we also define a new concept of a fundamental convergence in the (C) mean of sequences of measurable functions and discuss its theoretical underpinnings along with related interpretation issues as well as deliver some new results. Furthermore, an application of this concept is discussed in the context of information fusion. More specifically, based on the theoretical investigations, this idea is applied to the determination of a measurable function being used in the Choquet integral.     

Multiple criteria decision making method based on normal interval‐valued intuitionistic fuzzy generalized aggregation operator

On the basis of the normal intuitionistic fuzzy numbers (NIFNs), we proposed the normal interval‐valued intuitionistic fuzzy numbers (NIVIFNs) in which the values of the membership and nonmembership were extended to interval numbers. First, the definition, the properties, the score function and accuracy function of the NIVIFNs are briefly introduced, and the operational laws are defined. Second, some aggregation operators based on the NIVIFNs are proposed, such as normal interval‐valued intuitionistic fuzzy weighted arithmetic averaging operator, normal interval‐valued intuitionistic fuzzy ordered weighted arithmetic averaging operator, normal interval‐valued intuitionistic fuzzy hybrid weighted arithmetic averaging operator, normal interval‐valued intuitionistic fuzzy weighted geometric averaging operator, normal interval‐valued intuitionistic fuzzy ordered weighted geometric averaging operator, normal interval‐valued intuitionistic fuzzy hybrid weighted geometric averaging operator, and normal interval‐valued intuitionistic fuzzy generalized weighted averaging operator, normal interval‐valued intuitionistic fuzzy generalized ordered weighted averaging operator, normal interval‐valued intuitionistic fuzzy generalized hybrid weighted averaging operator, and some properties of these operators, such as idempotency, monotonicity, boundedness, commutativity, are studied. Further, an approach to the decision making problems with the NIVIFNs is established. Finally, an illustrative example is given to verify the developed approach and to demonstrate its practicality and effectiveness. © 2015 Wiley Periodicals, Inc. Complexity 21: 277–290, 2016     

Generalized Choquet-like aggregation functions for handling bipolar scales

We are interested in modeling interaction between criteria in multi-criteria decision making when underlying scales are bipolar. Interacting phenomena involving behavioral bias between attractive and repulsive values are in particular considered here. We show in an example that both the Choquet integral and the cumulative prospect theory (CPT) model fail to represent these interacting phenomena. Axioms that enable the construction of the preferences of the decision maker over each attribute, and the representation of his preferences about aggregation of criteria are introduced and justified. We show there is a unique aggregation operator that fits with these axioms. It is based on the notion of bi-capacity and generalizes both the Choquet integral and the CPT model.     

k-intolerant capacities and Choquet integrals

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying capacity, we introduce the concept of k-intolerant capacities which, when varying k from 1 to n, cover all the possible capacities on n objects. Just as the concepts of k-additive capacities and p-symmetric capacities have been previously introduced essentially to overcome the problem of computational complexity of capacities, k-intolerant capacities are proposed here for the same purpose but also for dealing with intolerant or tolerant behaviors of aggregation. We also introduce axiomatically indices to appraise the extent to which a given capacity is k-intolerant and we apply them on a particular recruiting problem.     

Probability density functions based weights for ordered weighted averaging (OWA) operators: An example of water quality indices

This paper explores the application of ordered weighted averaging (OWA) operators to develop water quality index, which incorporates an attitudinal dimension in the aggregation process. The major thrust behind selecting the OWA operator for aggregation of multi-criteria is its capability to encompass a range of operators bounded between minimum and maximum. A new approach for generating OWA weight distributions using probability density functions (PDFs) is proposed in this paper. The basic parameters (mean and standard deviation) of the probability density functions can be determined using the number of criteria (e.g., water quality indicators) in the aggregation process.     

A subquadratic algorithm for constructing approximately optimal binary search trees

An algorithm is presented which constructs an optimal binary search tree for an ordered list of n items, and which requires subquadratic time if there is no long sublist of very low frequency items. For example, time = O(n^1.6) if the frequency of each item is at least /n for some constant > 0. A second algorithm is presented which constructs an approximately optimal binary search tree. This algorithm has one parameter, and exhibits a trade-off between speed and accuracy. It is possible to choose the parameter such that time = O(n^1.6) and error = o(1).     

Ordered median problem with demand distribution weights

The ordered median function unifies and generalizes most common objective functions used in location theory. It is based on the ordered weighted averaging (OWA) operator with the preference weights allocated to the ordered distances. Demand weights are used in location problems to express the client demand for a service thus defining the location decision output as distances distributed according to measures defined by the demand weights. Typical ordered median model allows weighting of several clients only by straightforward rescaling of the distance values. However, the OWA aggregation of distances enables us to introduce demand weights by rescaling accordingly clients measure within the distribution of distances. It is equivalent to the so-called weighted OWA (WOWA) aggregation of distances covering as special cases both the weighted median solution concept defined with the demand weights (in the case of equal all the preference weights), as well as the ordered median solution concept defined with the preference weights (in the case of equal all the demand weights). This paper studies basic models and properties of the weighted ordered median problem (WOMP) taking into account the demand weights following the WOWA aggregation rules. Linear programming formulations were introduced for optimization of the WOWA objective with monotonic preference weights thus representing the equitable preferences in the WOMP. We show MILP models for general WOWA optimization.     

A GRASP algorithm for the multi-criteria minimum spanning tree problem

This paper proposes a GRASP (Greedy Randomized Adaptive Search Procedure) algorithm for the multi-criteria minimum spanning tree problem, which is NP-hard. In this problem a vector of costs is defined for each edge of the graph and the problem is to find all Pareto optimal or efficient spanning trees (solutions). The algorithm is based on the optimization of different weighted utility functions. In each iteration, a weight vector is defined and a solution is built using a greedy randomized constructive procedure. The found solution is submitted to a local search trying to improve the value of the weighted utility function. We use a drop-and-add neighborhood where the spanning trees are represented by Prufer numbers. In order to find a variety of efficient solutions, we use different weight vectors, which are distributed uniformly on the Pareto frontier. The proposed algorithm is tested on problems with r=2 and 3 criteria. For non-complete graphs with n=10, 20 and 30 nodes, the performance of the algorithm is tested against a complete enumeration. For complete graphs with n=20, 30 and 50 nodes the performance of the algorithm is tested using two types of weighted utility functions. The algorithm is also compared with the multi-criteria version of the Kruskal’s algorithm, which generates supported efficient solutions. This work was funded by the Municipal Town Hall of Campos dos Goytacazes city. The used computer was acquired with resource of CNPq.     

Totally Ordered Commutative Monoids

A totally ordered monoid—or tomonoid , for short—is a commutative semigroup with identity S equipped with a total order \les that is translation invariant, i.e. , that satisfies: \forall x, y, z∈ S, x\les y\;\Rightarrow \; x+z \les y+z. We call a tomonoid that is a quotient of some totally ordered free commutative monoid formally integral. Our most significant results concern characterizations of this condition by means of constructions in the lattice \Z ⁿ that are reminiscent of the geometric interpretation of the Buchberger algorithm that occurs in integer programming. In particular, we show that every two-generator tomonoid is formally integral. In addition, we give several (new) examples of tomonoids that are not formally integral, we present results on the structure of nil tomonoids and we show how a valuation-theoretic construction due to Hion reveals relationships between formally integral tomonoids and ordered commutative rings satisfying a condition introduced by Henriksen and Isbell. April 15, 1999     

The Number of Hierarchical Orderings

An ordered set-partition (or preferential arrangement) of n labeled elements represents a single “hierarchy” these are enumerated by the ordered Bell numbers. In this note we determine the number of “hierarchical orderings” or “societies”, where the n elements are first partitioned into m ≤ n subsets and a hierarchy is specified for each subset. We also consider the unlabeled case, where the ordered Bell numbers are replaced by the composition numbers. If there is only a single hierarchy, we show that the average rank of an element is asymptotic to n/(4 log 2) in the labeled case and to n/4 in the unlabeled case. This revised version was published online in September 2006 with corrections to the Cover Date.     

On structures of bisubmodular polyhedra

A bisubmodular polyhedron is defined in terms of a so-called bisubmodular function on a family of ordered pairs of disjoint subsets of a finite set. We examine the structures of bisubmodular polyhedra in terms of signed poset and exchangeability graph. We give a characterization of extreme points together with an O(n ²) algorithm for discerning whether a given point is an extreme point, wheren is the cardinality of the underlying set, and we assume a function evaluation oracle for the bisubmodular function. The algorithm also determines the signed posetructure associated with the given point if it is an extreme point. We reveal the adjacency relation of extreme points by means of the Hasse diagrams of the associated signed posets. Moreover, we investigate the connectivity and the decomposition of a bisubmodular system into its connected components.     

On the construction of weighted time-optimal B-trees

B-trees have been popular data structures since their definition. Their success is due to the fact that a B-tree containingn keys is balanced with a height ofO(logn). However, for a given set of elements and their access frequencies, one can construct many B-trees (possibly with different heights). The average access costs of these trees may vary significantly. An algorithm to construct a weighted time-optimal B-tree is presented. A weighted time-optimal B-tree is one in which the weighted access cost is minimized. A dynamic programming algorithm is used to construct a weighted time-optimal B-tree givenn elements and their weights. The algorithm runs in timeO(mn ³ logn) and has a storage requirement ofO(mn ² logn) wherem is the order of the B-tree andn is the number of keys.This research was supported in part by Texas Advanced Research Grant 1080 and NASA Grant NAG 5–739.