The article addresses morphological approaches to design of modular systems. The following methods are briefly described: (i) basic version of morphological analysis (MA), (ii) modification of MA as method of closeness to ideal point(s), (iii) reducing of MA to linear programming, (iv) multiple choice problem, (v) quadratic assignment problem, (vi) Pareto-based MA (i.e., revelation of Pareto-ef...

Evolutionary Algorithms are recognized to be efficient to deal withMulti-objective Optimization Problems(MOPs) which are difficult to be solved with traditional methods. Here a newMulti-objective Optimization Evolutionary Algorithm named DGPS which is compound with Geometrical Pareto Selection Method (GPS), Weighted SumMethod (WSM) and Dynamical Evolutionary Algorithm (DEA) is proposed. Some fa...

We study an implementation problem of Pareto efficiency as a subgame perfect equilibrium outcome in extensive form games, faced by a mediator who is ignorant about the payoff structure of the game. We introduce a novel class of sequential commitment games, where players make voluntary unconditional commitments in a prescribed order. Our main result is surprisingly positive: We show that a parti...

This paper revisits the college admissions problem and studies the efficiency, incentive, and monotonicity for colleges. We show that max-min criterion that is stronger than substitutability, together with the quota-saturability that requires having enough acceptable applicants, guarantees weak Pareto efficiency and strategy-proofness for colleges under the colleges-proposing deferred acceptanc...

We examine the effect of false-name bids on combinatorial auction protocols. Falsename bids are bids submitted by a single bidder using multiple identifiers such as multiple e-mail addresses. The obtained results are summarized as follows: 1) The Vickrey-Clarke-Groves (VCG) mechanism, which is strategy-proof and Pareto efficient when there exists no false-name bids, is not false-name-proof, 2) ...

The paper describes some basic approaches to detection of bottlenecks in composite (modular) systems. The following basic system bottlenecks detection problems are examined: (1) traditional quality management approaches (Pareto chart based method, multicriteria analysis as selection of Pareto-efficient points, and/or multicriteria ranking), (2) selection of critical system elements (critical co...

A problem that sometimes occurs in multiobjective optimization is the existence of a large set of Pareto-optimal solutions. Hence the decision making based on selecting a unique preferred solution becomes difficult. Considering models with rational B-efficiency relieves some of the burden from the decision maker by shrinking the solution set. This paper focuses on solving multiobjective optimiz...

We characterize the class of weakly efficient n-person bargaining solutions that solely depend on the ratios of the players’ ideal payoffs. In the case of at least three players the ratio between the solution payoffs of any two players is a power of the ratio between their ideal payoffs. As special cases this class contains the Egalitarian and the Kalai-Smorodinsky bargaining solutions. For 2-p...

This paper considers a pure exchange stochastic overlapping generations model in which agents live for two periods. At each date, either a young or an old agent has larger endowments than the other, which is stochastically determined. In addition to the uncertainty, commitment cannot be externally enforced in this economy. In this environment, I suggest a transfer rule from a young agent to an ...

In this paper, we revisit a long-standing question on the structure of strategyproof and Pareto-efficient social choice functions (SCFs) in classical exchange economies (Hurwicz (1972)). Using techniques developed by Myerson in the context of auctiondesign, we show that in a specific quasi-linear domain, every Pareto-efficient and strategy-proof SCF satisfying non-bossiness and a mild continuit...