An organizing principle for dynamic estimation

This paper develops a general multicriteria framework for the sequential estimation of process states. Three well-known state estimation algorithms (the Viterbi, Larson-Peschon, and Kalman filters) are derived as monocriterion specializations. The multicriteria estimation framework is used to clarify both Bayesian and classical statistical procedures for treating potential model misspecification. A recently developed bicriteria specialization (flexible least cost), explicitly designed to take specification errors into account, is also reviewed. The latter application suggests how the multicriteria framework might be used to construct estimation algorithms capable of handling disparate sources of information coherently and systematically, without forced scalarization.This paper is a revised version of Ref. 1. The authors are grateful to D. Hendry, R. Huss, H. Quirmbach, and J. Veitch for helpful comments and suggestions.     

Subjective Evaluation of Discomfort in Sitting Positions

We study the modelling of the subjective sensation of discomfort for subjects seated during a long time, in terms of local discomforts. The methodology uses fuzzy measures and integrals in a multicriteria decision making process, which enables the modelling of complex interaction between variables. Results of the experiment are detailed, giving models with respect to different kinds of discomfort, and to different macro-zones of the body.     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

Ranking DMUs by using interval DEA cross efficiency matrix with acceptability analysis

Cross efficiency method is an extension of data envelopment analysis (DEA), and has been widely used for ranking performance of decision making units (DMUs). To eliminate the non-uniqueness of cross efficiency scores, the aggressive and benevolent strategies have been proposed as secondary goals to determine the unique cross efficiency score. The current paper aims to propose an alternative strategy which does not consider the preference of the decision maker in choosing aggressive or benevolent strategy. Instead, the paper considers all possible weight sets in weight space when computing the cross efficiency and each DMU is given an interval cross efficiency. By using the stochastic multicriteria acceptability analysis (SMAA-2) method, all DMUs in the interval cross efficiency matrix (CEM) could be fully ranked according to the acceptability indices. A numerical example about efficiency evaluation to seven academic departments in a university is illustrated.     

Multicriteria Approach to Bilevel Optimization

In this paper, we study the relationship between bilevel optimization and multicriteria optimization. Given a bilevel optimization problem, we introduce an order relation such that the optimal solutions of the bilevel problem are the nondominated points with respect to the order relation. In the case where the lower-level problem of the bilevel optimization problem is convex and continuously differentiable in the lower-level variables, this order relation is equivalent to a second, more tractable order relation. Then, we show how to construct a (nonconvex) cone for which we can prove that the nondominated points with respect to the order relation induced by the cone are also nondominated points with respect to any of the two order relations mentioned before. We comment also on the practical and computational implications of our approach.     

A sufficiency condition for coalitive pareto-optimal solutions

In ak-player, nonzero-sum differential game, there exists the possibility that a group of players will form a coalition and work together. If allk players form the coalition, the criterion usually chosen is Pareto optimality whereas, if the coalition consists of only one player, a minmax or Nash equilibrium solution is sought.In this paper, games with coalitions of more than one but less thank players are considered. Coalitive Pareto optimality is chosen as the criterion. Sufficient conditions are presented for coalitive Pareto-optimal solutions, and the results are illustrated with an example.     

The design of a database for multiperson decision support

The MEDIATOR approach to implementing negotiation support systems views collaborative decisions as complex, evolving data objects to be managed by an extended database management system. The paper outlines the requirements and a rough design for such a DBMS. Specifically, our approach represents decision problems as multispatial mappings that eventually lead from real-world observations to group utilities. Group decision processes are represented as nested transactions which collaboratively design this mapping data structure, controlled by group communication norms represented as integrity constraints. The paper concludes with some implementation considerations, using a conceptual model base management approach.     

Folk theorems in multicriteria repeated N-person games

In this paper we consider the question of existence of a multicriteria-Nash equilibrium in multicriteria multistage N-person games. Besides, we present several forms of multicriteria-Nash equilibrium for repeated games both with infinitely and finitely many stages. The author thanks the Spanish Ministry of Science and Technology through grant number BFM01-2378.     

A cone separation theorem

The notion of separation is extended here to include separation by a cone. It is shown that two closed cones, one of them acute and convex, can be strictly separated by a convex cone, if they have no point in common. As a matter of fact, an infinite number of convex closed acute cones can be constructed so that each of them is a separating cone.The research was done while the author was a visiting professor at the University of British Columbia, Vancouver, British Columbia, Canada.     

Proper inequality constraints and maximization of index vectors

For obtaining the set of all quasi-supremal index vectors (or all maximal index vectors, or all Pareto-optimal solutions) of a multiple-objective optimization problem, we present, in this paper, the method of proper inequality constraints, which does not rely on any convexity condition at all, but by which one can obtain the entire desired set. This method is based on the observation that optimizing the index of one of the objectives, with some arbitrary bounds assigned to all other objectives, may still result in inferior solutions, unless these bounds areproper. Various necessary and/or sufficient conditions are presented for the properness test.This work was supported by the National Science Foundation under Grant No. GK-32701.