In this paper, we study the matroid base packing problem from the perspective of cooperative game theory and define the associated matroid base packing game. This model extends the network strength game of Baiou and Barahona (2020) from graphic matroids to general matroids. Building on the exchange structure of matroid, we develop a graph theoretic framework for analyzing the core and the nucleolus in this game. This framework yields a compact characterization of core nonemptiness and enables polynomial time algorithms for testing core nonemptiness, finding a core allocation, and computing the nucleolus. In particular, the approach provides a broader and more structured framework for the nucleolus computation problem arising in network strength games studied by Baiou and Barahona (2020), covering both the nonempty core and empty core cases.

翻译：暂无翻译