Information‐centric networking (ICN) has received much attention from the governments and researcher in recent years thanks to its in‐network caching feature. In this paper, a cooperative ICN caching scheme based on game theory is proposed, where the ICN topology has been partitioned into some domains. For each piece of content in the individual domain, the caching value degree for the local domain as well as the neighboring domains is computed and it is regarded as the key factor of caching decision. In particular, the caching decision aims at minimizing the average delay of obtaining contents. The experimental results show that the novel cooperative caching scheme has higher cache hit rate and lower delay compared with two benchmarks.