科研之友
微信
新浪微博
Facebook
分享链接
摘要
The core is a set-valued solution concept for cooperative games. In situations where the characteristic function is not monotone the classical definition may not be sufficient. Hence, we propose a subset of the core that is called subcoalition-perfect core. It will be proven that the subcoalition-perfect core coincides with the set of non-negative core allocations. Furthermore, an ellipsoid algorithm is provided which may be applied in many applications to compute an element in the subcoalition-perfect core. In addition, we discuss an application where the characteristic function is not monotone and perform a computational study.
- 出版日期2010-12
