Wednesday, 15:45 - 16:10 h, Room: MA 043


Ping Zhao
A mixed-integer programming approach to the determination of a core element for an n-person cooperative game with nontransferable utility

Coauthor: Chuangyin Dang


A fundamental issue concerning n-person cooperative game with nontransferable utility is about core existence. Sufficient conditions like balancedness and necessary conditions for nonemptiness of the core have been given. From a complexity theoretic standpoint, the core existence problem has been proved to be NP-complete, which also indicates computation of core element intractable in general case. We transform a core computation problem into a mixed-integer programming problem such that core existence is equivalent to having an integer point in a polytope. The core of a game can be computed directly by this MIP in virtue of approximating characteristic function by a finite numbers of corners. This approach renders sufficient and necessary conditions dispensable and the information about core can be derived directly by solving the mixed-integer programming. Case in large scale can be computed in the MIP through CPLEX.


Talk 2 of the contributed session Wed.3.MA 043
"Solving cooperative games" [...]
Cluster 8
"Game theory" [...]


  There are three major facts that should be watched out for in all payday loans in the United States. The main advantage of Viagra Soft Tablets comparing with other products of this type is its faster on-set effect.