We provide axiomatic characterizations of two natural families of rules for aggregating equivalence relations: the family of join aggregators and the family of meet aggregators. The central conditions in these characterizations are two separability axioms. Disjunctive separability, neutrality, and unanimity characterize the family of join aggregators. On the other hand, conjunctive separability...

Uniqueness of specification of a bivariate distribution by a Pareto conditional and a consistent regression function is investigated. New characterizations of the Mardia bivariate Pareto distribution and the bivariate Pareto conditionals distribution are obtained.

The following MOEA algorithms are briefly summarized and compared: • NPGA Niched Pareto Genetic Algorithm (1994) – NPGA II (2001) • NSGA Non-dominated Sorting Genetic Algorithm (1994) – NSGA II (2000) • SPEA Strength Pareto Evolutionary Algorithm (1998) – SPEA2 (2001) – SPEA2+ (2004) – ISPEA Immunity SPEA (2003) • PAES Pareto Archived Evolution Strategy (2000) – M-PAES Mimetic PAES (2000) • PES...

We study retrading via reopening of trading posts in a market game where the static Nash equilibria yield Pareto suboptimal allocations whenever endowments are Pareto suboptimal. We show that there are allocations on the Pareto frontier that can be approximated arbitrarily closely along some Subgame Perfect Equilibrium path of retrading. The approximation result can also be proved when traders ...

This paper investigates three disparate design cases where the newly developed s-Pareto frontier based concept selection paradigm is used to compare competing design concepts under a multiobjective optimization framework. The new paradigm, which was recently introduced by the authors, is based on the principle of Pareto optimality – a principle that defines an important class of optimal solutio...