In the game theory terminology, an outcome vector ( <{u}_1^,,kern0.5em0.5em,,,kern0.5em {u}_n^> ) is a unique and fair-efficient solution, called the NBS that fulfills the Nash axioms [6].
We propose a P2P search solution, called EZSearch, that enables efficient multidimensional search for remotely located contents that best match the search criteria.
There is a solution called unitization.
Besides the weak efficiency and efficiency mentioned above, a meaningful solution concept called a strict efficient solution of higher-order (also called a strict minimizer of higher-order) was recently extended by Jiménez in [10] from the strict minimizer of higher-order in scalar optimization given by Auslender in [11] and Ward in [12].
If,, and if is a globally efficient solution of (VEPC), then is called a globally efficient solution of (VOP).
If,, and if is a globally efficient solution of (VEPC), then is called a globally efficient solution of (VVIC).
A point is called an efficient solution to (VMP), if there is no such that.
Definition 2.1 A feasible solution x ¯ ∈ Γ ( Ω t 0, t 1 ) is called an efficient solution for problem (MVP) if there is no other feasible solution x ∈ Γ ( Ω t 0, t 1 ) such that F ( x ≤ F ( x ¯.
A point x ∊ A is called an efficient solution to (PVOPEP) if F x,y,lambda ) notin - C lambda )backslash { theta },{text{ for all}};y in Aleft( lambda right).
The weakly efficient solution set (S_{w} u)) is called stable if the set-valued map (S_{w}) is continuous at u.
If is nonempty and satisfies (1.4), then we call a weak efficient solution for VEP, and if satisfies (1.5), then we call a strong solution for VEP.
