title: The Worst-Case Weighted Multi-Objective Game with an Application to Supply Chain Competitions.
abstract: In this paper, we propose a worst-case weighted approach to the multi-objective n-person non-zero sum game model where each player has more than one competing objective. Our "worst-case weighted multi-objective game" model supposes that each player has a set of weights to its objectives and wishes to minimize its maximum weighted sum objectives where the maximization is with respect to the set of weights. This new model gives rise to a new Pareto Nash equilibrium concept, which we call "robust-weighted Nash equilibrium". We prove that the robust-weighted Nash equilibria are guaranteed to exist even when the weight sets are unbounded. For the worst-case weighted multi-objective game with the weight sets of players all given as polytope, we show that a robust-weighted Nash equilibrium can be obtained by solving a mathematical program with equilibrium constraints (MPEC). For an application, we illustrate the usefulness of the worst-case weighted multi-objective game to a supply chain risk management problem under demand uncertainty. By the comparison with the existed weighted approach, we show that our method is more robust and can be more efficiently used for the real-world applications.
authors.affiliation: Business School, University of Shanghai for Science and Technology, Shanghai, P.R. China.
authors.forename: Shaojian
authors.initials: S
authors.lastname: Qu
authors.affiliation: Business School, University of Shanghai for Science and Technology, Shanghai, P.R. China.|The Logistics Institute-Asia Pacific, National University of Singapore, Singapore, Singapore.
authors.forename: Ying
authors.initials: Y
authors.lastname: Ji
mesh_terms: D000465:Algorithms; D003132:Commerce; D003163:Competitive Behavior; D003258:Consumer Behavior; D005716:Game Theory; D006801:Humans; D015233:Models, Statistical
references.citation: Evol Comput. 2006 Winter;14(4):463-94
references.pmid: 17109607
references.citation: PLoS One. 2015;10(9):e0138970
references.pmid: 26406986
references.citation: PLoS One. 2015;10(6):e0129542
references.pmid: 26102082