Puerto Albandoz, JustoPerea Rojas Marcos, Federico2020-04-242020-04-2420180022-247Xhttps://riunet.upv.es/handle/10251/141455[EN] In this paper, we characterize minimax and Pareto-optimal security payoff vectors for general multicriteria zero-sum matrix games, using properties similar to the ones that have been used in the single criterion case. Our results show that these two solution concepts are rather similar, since they can be characterized with nearly the same sets of properties. Their main difference is the form of consistency that each solution concept satisfies. We also prove that both solution concepts can transform into each other, in their corresponding domains. (C) 2017 Elsevier Inc. All rights reserved.Reserva de todos los derechosMulticriteria gamesPayoffsCharacterizationESTADISTICA E INVESTIGACION OPERATIVAOn minimax and Pareto optimal security payoffs in multicriteria gamesArtÃculo10.1016/j.jmaa.2017.01.002Abierto