I'm interested in the mathematical analysis of zero-sum games in which there are just two sides or teams, but multiple players on each team, who have imperfect information about the game state. Bridge is perhaps the simplest example of such a game. However, I'm specifically more interested in a version of a two-player Colonel Blotto game in which the two teams consist of players who don't necessarily know everything that is going on, or even what the other players on the same team are doing. (My underlying thought is to tweak the Blotto game into a slightly more realistic model of real-world elections.)
Is there any prior literature on this topic? Finding the right search terms seems elusive. For example, I did find a paper on A Blotto game with incomplete information (Adamo and Matros, Economics Letters 105 (2009), 100–102) but that paper deals with $K$ non-cooperative players rather than two teams with multiple players on each team. There is another math.SE question that seems related, Multiplayer cooperative game with imperfect information, but in that setting, there is only one team and not two, and besides, the question was not answered.