The Robust Weighted Multi-Objective Game.

This paper studies a class of multi-objective n-person non-zero sum games through a robust weighted approach where each player has more than one competing objective. This robust weighted multi-objective game model assumes that each player attaches a set of weights to its objectives instead of accessing accurate weights. Each player wishes to minimize its maximum weighted sum objective where the maximization is pointing to the set of weights. To address this new model, a new equilibrium concept-robust weighted Nash equilibrium is obtained. The existence of this new concept is proven on suitable assumptions about the multi-objective payoffs.

1 Introduction

This paper addresses the following multi-objective game with finite players in the normal form, MG : = (N, {S }, {F }). Here N : = {1, ⋯, n} is a finite set of players, is the set of actions for player i and F is the multi-objective payoff function of player i and the number of objectives is set as b . Then F is defined as a mapping from the Cartesian product into (since this paper considers the multi-objective game, so without any loss of generality throughout this paper we assume that each player i has more than one objective in his payoff function, that is b ≥ 2). Given x ∈ S to be played, we specifically define . In this paper, given x : = (x 1, ⋯, x ) ∈ S to be played, then each player i has a multi-objective payoff function as which means that each player i has more than one competing objective.

Since there is more than one objective for each player in the above multi-objective game, an accepted equilibrium concept is the Pareto equilibrium, which has already been used in [1] and can be defined as follows.

Definition 1.1 A mixed strategy x ∈ S is a Pareto (resp. weak Pareto) equilibrium for MG if for each player i, x ∈ S is a Pareto optimal strategy (resp. a weak Pareto optimal strategy) against x, i.e., for any player i, i ∈ N, whose strategy x ∈ S to the other player’s strategies is a Pareto optimal strategy (resp. a weak Pareto optimal strategy) respectively to the following multi-objective optimization, that is there is no strategy u ∈ S such that where the partial orders ≼ and ≺ are defined as, for any given r, v ∈ R ,

MG is a generalization of the scalar criterion games and is used to modelling situations where two or more decision makers, called players, take actions by considering their individual multiple objectives. The study for multi-objective games dates back to Blackwell’s work which considers zero-sum games with multi-objective payoffs [2]. Since then, much attention has been siren to game models with multiple payoffs [3, 4]. One reason is that multi-objective models are more applicable to real-world situations [1].

In this paper, we consider n-person robust weighted MGs where each player has two or more objectives and is ambiguous about the weights to the objectives. Specifically, we focus on finite multi-objective games where the weights of objectives are uncertain and are assumed to belong to a convex and compact set. In our model, we assume that all players are risk-averse and each player uses a robust optimization approach to manage the uncertainty of weights, assuming that the other players are robust optimizers as well. Note that the robust optimization approach does not concern game data nor the other players’ strategies, but only the weights to the objectives.

In MGs, since there are several competing objectives to be considered for each player and it is not possible to simultaneously optimize all objectives, a commonly accepted approach for coping with this setting is the weighted approach. This approach assigns a nonnegative weight by considering the importance of the corresponding objective function. A player can then make a decision by optimizing a weighted sum objective by assuming that the other players also make their decision by optimizing their own weighted sum objective [1, 3, 5]. A weighted Nash equilibrium point can be obtained if each player makes a decision by optimizing his weighted sum function. However the current weighted approach has several shortcomings. As shown in applications, the weights are not known a priori and the player has to choose them. Ambiguity often exists in the choice of the weights to the objectives, as it is not easy to decide relative weights for each objective. In addition, as shown in the literature on multi-objective optimization the relative weights provided by the same decision-maker may rely on some elicitation methods [6, 7]. Therefore it is necessary to provide a new approach to cope with these issues.

Hence, our motivation to utilize a robust weighted approach is that it provides an alternative way to deal with ambiguity of the weights. Further, if each player under an MG chooses the robust weighted approach, then we show that there is at least a robust weighted Nash equilibrium which further guarantees the existence of the Pareto Nash equilibrium. As such that the primary contributions of this paper are as follows. We propose a robust weighted approach for multi-objective n-person non-zero sum games, extending the notion of robust weighted multi-objective optimization models to multi-objective games; Our work can also be seen as an extension of the robust one-shot scalar games. We prove the existence of a robust weighted Nash equilibrium.

2 Preliminaries

Suppose each player i has a set of weights for his objectives, then we can provide a robust weighted Nash equilibrium concept for MG, where . We note that when W , ∀i ∈ N, reduces to a singleton, the robust weighted Nash equilibrium becomes the weighted Nash equilibrium.

Definition 2.1 Given a closed set , i ∈ N, then a mixed strategy x ∈ S is a robust weighted Nash equilibrium of MG if for each player i, x is the optimum to the following robust optimization problem

For the simplicity, we denote by RoP(W ) for given W problem Eq (2.1) and its optimal value (with the convention that RoP(W ) = +∞ if the problem is infeasible). For any i ∈ N, given two weight sets , it is obvious that . Furthermore in this robust weighted Nash equilibrium concept, although we do not suppose the convexity of W , ∀i ∈ N, actually the robust weighted Nash equilibrium concept of MG with closed weight sets combination , is equivalent to the robust weighted Nash equilibrium concept of MG with closed weight sets conv(W) : = (conv(W 1), ⋯, conv(W )) ⊂ W , where conv(⋅) denotes the convex hull. This is equivalent to showing that for any player i and fixed x − ∈ S − the equivalence of the following two sets and It is easy from W ⊂ conv(W ) to see that for any , (w ) F (x −, u ) ≤ γ, ∀w ∈ W , that is (γ, x ) ∈ χ , which means that . Next we are going to prove that . To this end, for any (γ, x ) ∈ χ , we show . For any w ∈ conv(W ), there exist w ∈ W , k = 1, ⋯, κ, such that , here λ ≥ 0(k = 1, ⋯, κ), and for some κ ≤ b + 1. From (γ, x ) ∈ χ , (w ) F (x −, x ) ≤ γ, k = 1, ⋯, κ, which implies that This means that . Therefore , ∀i ∈ N. Thus, for the rest of this paper, we assume that W is a closed and convex subset of , ∀i ∈ N.

Different from the weighted Nash equilibrium, the robust weighted Nash equilibrium proposed in this paper seeks to find an equilibrium solution that is robust and that is feasible for the robust weight within the family of weights. Wang [1] shows that for any weighted Nash equilibrium of MG with weights given in , ∀i ∈ N, then it is either a weak Pareto equilibrium or a Pareto equilibrium. In the following proposition, we show that the robust weighted Nash equilibrium of MG inherits the properties of the weighted Nash equilibria, that is any robust weighted Nash equilibrium of MG with weights set , i ∈ N is either a weak Pareto equilibrium or a Pareto equilibrium.

Theorem 2.2 For any i ∈ N, given a closed set , if x* : = (x 1*, ⋯, x ) ∈ S is a robust weighted Nash equilibrium of MG with the combination W = (W 1, ⋯, W ) of weight sets, then we have the following results,

x* is a weak Pareto Nash equilibrium of MG;

if for any player i, i ∈ N, with all weights in W are all positive, then x* is a Pareto Nash equilibrium of MG;

for any player i, i ∈ N, if x is the unique optimal solution of RoP(W ), then x* is a Pareto Nash equilibrium of MG.

Proof. The proof for this theorem directly follows from Theorem 2.2 of Hu and Mehrotra [8] and Definitions 1.1 and 2.1.

Below we describe a class of multi-objective games that can be resolved by using robust weighted approach.

Example 1 A set of n manufacturers (the players) supply P products to m retailers in order to maximize the profit and minimize the risk at the same time by anticipating the order quantities of the retailers and the wholesale prices resulting from the market clearing conditions. Manufacturer i (i = 1, ⋯, n) chooses his supply quantity to maximize his profit and minimize the risk in the wholesale market, assuming that the other manufacturers keep their supply quantities fixed, and anticipating the market clearing wholesale market price as well as the retailer order quantities. Mathematically, manufacturer i faces the following multi-criteria decision problem, where c ∈ R is the ith manufacturer unit uncertain cost, y ∈ R is the supply quantity of the ith manufacturer and γ ∈ R is the jth retailer order quantity for a given wholesale price π, the first constraint is the wholesale market clearing conditions, and r : R × R → R is a general risk function for manufacturer i.

If each manufacturer has a set of weights , i = 1, ⋯, n, then a robust weighted manufacturer equilibrium can be obtained if each manufacture solves the following robust weighted problem, i = 1, ⋯, n

3 Existence of Robust Weighted Nash Equilibrium

In this section, we first present the existence theorem on the robust weighted Nash equilibria in MG with compact and convex weight sets by using Kakutani’s [9] fixed point theorem which has been extensively used to prove the existence of an equilibrium in scalar games. We show that the robust-weighted Nash equilibria of a robust weighted multi-objective game are guaranteed to exist. Second, we discuss the conditions for ensuring the existence of robust weighted Nash equilibria. Before continuing to the existence theorem, we first give Kahutani’s fixed point theorem and a relevant definition, namely that of upper-semi continuity.

Definition 3.1 A point-to-set mapping ψ : S → 2 is said to be upper semi-continuous if y ∈ ψ(x ), n = 1, 2, 3, ⋯, , imply that y ∈ ψ(x).

Theorem 3.2 (Kakutani’s fixed point theorem). Suppose that S is a closed, bounded, and convex set in Euclidean space, and ψ is an upper semi-continuous point-to-set mapping from S to the family of closed, convex subsets of S, then ∃x ∈ S such that x ∈ ψ(x).

To utilize the above theorem, we first define a suitably constructed correspondence whose fixed point is an equilibrium. For this purpose for any given x = (x 1, ⋯, x ) ∈ S, y = (y 1, ⋯, y ) ∈ S and weight sets combination , we define where for any i ∈ N the function ρ : S × S → R is given as follows,

Similar to the proof of Lemma 2.3 given by [1], it is easy to see from the following lemma the equivalence of the robust weighted Nash equilibrium with the fixed point of the correspondence ϕ .

Lemma 3.3 A given strategy combination is a robust weighted Nash equilibrium of MG with iff is a fixed point of the mapping ϕ .

Proof. If is a robust weighted Nash equilibrium of MG with given , from Definition 2.1, The above inequality implies that So from the definition of ρ , , ∀y ∈ S. Therefore , i.e., is a fixed point of the mapping ϕ .

Similarly, for any given , if is a fixed point of the mapping ϕ , we can prove that is also a robust weighted Nash equilibrium of MG with the weight set combination W.

The above lemma shows that the existence of the robust weighted Nash equilibria is equivalent to the existence of the fixed points of the mapping ϕ . So we only need to show that the correspondence ϕ satisfies the assumptions of Kakutani’s theorem that is to show that for weight sets combination W, under some given assumptions about the functions , ∀j = 1, ⋯, b , i ∈ N, ϕ is an upper semi-continuous point-to-set mapping from S to the family of closed, convex subsets of S. To reveal that the correspondence ϕ meets the assumptions of Kakutani’s Theorem, we first need several technical results.

Lemma 3.4 Given a weight sets combination W ⊂ W , if is continuous on S and for any fixed x −, is convex on S , ∀j = 1, ⋯, b , i ∈ N, then we have that

ρ (⋅, ⋅) is continuous on S × S;

for any fixed x ∈ S, ρ (x, ⋅) is convex on S.

Proof. 1. We show that for any given ϵ > 0, there is a positive constant δ such that for any (x, y) ∈ S × S and if then It follows from the continuity of that for any given ϵ > 0, there is a positive constant δ such that for any (x, y) ∈ S×S and if then The above inequality leads to

Therefore it follows from (3.2) and that given , there is such that and (3.1) holds.

2. For any fixed x ∈ S, given λ ∈ [0, 1] and , we have that where the first inequality comes from the convexity of .

The above lemma gives the continuity and convexity for function ρ which are two key results for proving the main existence theorem below. The two results are used to prove the upper semi-continuity and convexity of the mapping ϕ respectively. We now propose the main result of this section.

Theorem 3.5 Suppose each strategy set S is a nonempty compact convex subset of , ∀i ∈ N. Then under the conditions of Lemma 3.4, the multi-objective game MG has at least one robust weighted Nash equilibrium with W ⊂ W .

Proof. From Lemma 3.3, for the proof of this theorem, it suffices to show that the correspondence ϕ meets the assumptions of Kakutani’s theorem. To this end, we need to show that ϕ is an upper semi-continuous point-to-set mapping from S to the family of closed, convex subsets of S. We first show that for any given x ∈ S, ϕ (x) is a closed, convex subset of S.

From the continuity of ρ (⋅, ⋅) and the existence of the minimum of the continuous function on a compact set, we have that . Therefore ϕ (x) ≠ ∅, for any x ∈ S. Note that by definition, ϕ (x) ∈ S, ∀x ∈ S. Next we show that ϕ (⋅) is convex for any x ∈ S. Suppose z : = (z 1, ⋯, z ), v : = (v 1, ⋯, v ) ∈ ϕ(x). Then for any λ ∈ [0, 1], we have where the first inequality comes from the convexity of ρ (x, ⋅) and the second inequality comes from the definitions for z and v. The above inequality and the convexity of S lead to λz + (1−λ)v ∈ ϕ (x) which implies that ϕ (⋅) is convex for any x ∈ S.

Finally, we show that ϕ (⋅) is a upper semi-continuous correspondence. Suppose x → x, z → z, and z ∈ ϕ (x ), then we have Taking limits in the above inequality and noting the continuity of ρ (⋅, ⋅), we have The above inequality and the compactness of set S imply that z ∈ ϕ (x). Therefore, we complete the proof that ϕ is an upper semi-continuous correspondence and the closeness of the set ϕ for any x ∈ S follows from the upper-semi-continuity of ϕ. Therefore, ϕ meets the assumptions of Kakutani’s fixed point theorem.

4 Conclusion

A robust weighted approach is proposed to a class of multi-objective games, where each player has a set of weights to its objectives instead of accessing accurate weights. This method leads to the corresponding robust weighted game model and a robust weighted Nash equilibrium is presented to address the new model. We show the existence of equilibrium under mild assumptions about the multi-objective payoffs. Further studies are to see how to design appropriate algorithms so as to numerically realize the robust weighted Nash equilibrium.