title: The Robust Weighted Multi-Objective Game.
abstract: 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.
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: Shaojian
authors.initials: S
authors.lastname: Qu
authors.affiliation: The Logistics Institute-Asia Pacific, National University of Singapore, Singapore, Singapore; Natural Science Center, Harbin Institute of Technology, Harbin, P.R. China.
authors.forename: Ying
authors.initials: Y
authors.lastname: Ji
authors.affiliation: The Logistics Institute-Asia Pacific, National University of Singapore, Singapore, Singapore; NUS Business School, National University of Singapore, Singapore, Singapore.
authors.forename: Mark
authors.initials: M
authors.lastname: Goh
mesh_terms: D000465:Algorithms; D005716:Game Theory