In a decentralized setting the game-theoretical predictions are that only strong blockings are allowed to rupture the structure of a matching. This paper argues that, under indifferences, also weak blockings should be considered when these blockings come from the grand coalition. This solution concept requires stability plus Pareto optimality. A characterization of the set of Pareto-stable matc...

In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...

Skylines with partial order preference semantics often result in huge answer sets and what is worse, they cannot be computed efficiently. In this paper we will explore the evaluation of so-called restricted skyline queries with partial order preferences under the paradigm of weak Pareto dominance. Weak Pareto dominance removes all objects from skylines, which are dominated by other objects in s...

The overlapping expectations and the collective absence of arbitrage conditions introduced in the economic literature to insure existence of Pareto optima and equilibria with short-selling when investors have a single belief about future returns, is reconsidered. Investors use measures of risk. The overlapping sets of priors and the Pareto equilibrium conditions introduced by Heath and Ku for c...

In the well-known scheduling game, a set of jobs controlled by selfish players wishes each to minimize the load of the machine on which it is executed, while the social goal is to minimize the makespan, that is, the maximum load of any machine. We consider this problem on the three most common machines models, identical machines, uniformly related machines and unrelated machines, with respect t...

We propose strike mechanisms as a solution to the classical problem of Hurwicz and Schmeidler (1978) Maskin (1999) according which, in two-person societies, no Pareto efficient rule is Nash-implementable. A mechanism specifies number alternatives that each player vetoes. Each simultaneously casts these vetoes selects randomly one alternative among non-vetoed ones. For strict preferences over un...

Many practical optimization problems usually have several conflicting objectives. In those multi-objective optimization, no solution optimizing all objective functions simultaneously exists in general. Instead, Pareto optimal solutions, which are “efficient” in terms of all objective functions, are introduced. In general we have many Pareto optimal solutions. Therefore, we need to decide a fina...

In multidisciplinary optimization a designer solves a problem where there are different criteria usually contradicting each other. In general, the solution of such a problem is not unique. When seeking an optimal design, it is natural to exclude from the consideration any design solution which can be improved without deterioration of any discipline and violation of the constraints; in other wor...

Bargaining solutions that satisfy weak Pareto optimality, symmetry, and independence of equivalent utility representations are called standard. The Nash (1950) solution is the unique independent standard solution and the KalaiSmorodinsky (1975) solution is the unique monotonic standard solution. Every standard solution satisfies midpoint domination on triangles, or MDT for short. I introduce a ...

The main method of solving multi-objective programming is changing multi-objective programming problem into single objective programming problem, and then get Pareto optimal solution. Conversely, whether all Pareto optimal solutions can be obtained through appropriate method, generally the answer is negative. In this paper, the methods of norm ideal point and membership function are used to sol...