贏贏策略下集體能力集之最佳擴展方式

Abstract

傳統上，競局中雙方所採用的策略均侷限在自己所擁有的資源和能力集。 然而這僅僅使用自己的資源和能力集所能形成的合作策略不一定能滿足雙 方的需求。在這時，就必須要擴展雙方的能力集及互相支援對資源的需要 ，以形成加強的合作關係，並獲得更多報酬以滿足雙方的需求。所謂的能 力集擴展是指競局雙方為了要解決問題，而必須在解決問題的時間限制內 ，由已經獲得的能力集擴展到解決問題所需要的所有能力集。在Li及 Yu[11]中，能力集擴展的方式都只考慮個別的擴展的方式，且所要擴展的 能力集為已知。在本文中，假設雙方可在對方授權下使用對方所擁有的資 源及能力集。在此假設下，本文可以決定出集體能力集的併行擴展方向及 擴展的方式。而設計出二個混合 0-1多項式模式。並使用線性化的技巧將 混合0-1多項式模式轉換成混合0-1線性模式。此時我們可以獲得一個佳的 合作方式雙方的最佳合作方式及滿足雙方需求所需要的最少時間。 The cooperative strategies in a game are within the limited of each player's own resources and competence sets. Therefore, those strategies are not always enough to satisfy each other's need. At this time, we need to extend both players' competence sets and share each others' resources to form a stronger cooperative relationship and get a better result. We define "extending competence sets" as the both players in a game, under the time constraint of solving the problem, extend his own competence sets to all of the competence sets needed ( true competence sets ) to solve the problem. The way of competence sets extension in Li & Yu[11] only consider about the extension of individual competence sets, and the competence sets needed be get are predetermined. In order to fine out the true competence sets and the way of the extension of group competence sets, we design two mixed 0-1 polynomial models. By using linearization technique to transform mixed 0-1 polynomial models into a mixed 0-1 linear model. We, then, can obtain an optimal expansion of competence sets the shortest time that satisfies both players' needs.