两两相交
- 网络Pairwise
两两相交-
极大的无k个子集两两不相交的子集系的最小容量
The Smallest Size of a Maximal Family of Subsets of a Finite Set No k of Which are Pairwise Disjoint
-
另一种研究方法研究agents的最优划分，把Agents划分为若干个联盟（两两互不相交的子集），使各个联盟收益的总和最大。
Another researching branch is to study the optimal division of agents into coalitions ( the pairwise disjoint subsets ) so that the sum of the revenues of all coalitions is maximal .