一类多目标对策的两个解概念
On two solution concepts in a class of multicriteria games
摘要:
本文比较了一般多准则零和矩阵对策的两种解的概念:极大极小和帕累托最优安全支付向量。我们的两个标准的基础上,已被用于在相应的同行在单一标准的情况下,类似的属性,虽然他们需要补充两个新的一致性属性。而在标准的单准则游戏极小极大和最优安全支付一致,当我们有多个标准,这两个解决方案的概念不同。我们提供这两个概念的共同根源的解释,并强调它们之间的内在差异。
英文摘要:
In this paper we compare two solution concepts for general multicriteria zero-sum matrix games: minimax and Pareto-optimal security payoff vectors. We characterize the two criteria based on properties similar to the ones that have been used in the corresponding counterparts in the single criterion case, although they need to be complemented with two new consistency properties. Whereas in standard single criterion games minimax and optimal security payffs coincide, whenever we have multiple criteria these two solution concepts differ. We provide explanations for the common roots of these two concepts and highlight the intrinsic differences between them.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。