On the communication complexity oft-intersection problems in generalized Boolean algebras

We consider the following game: Two players independently choose a chain in a partially ordered set. How many bits of information have to be communicated until at least one of the players knows whether the chains have exactlyt elements in common? This model generalizes thet-intersection problem for subsets of a finite set. We establish the deterministic communication complexity in general. For the special cases of generalized Boolean algebras, we present improved nondeterministic and probabilistic protocols that are of optimal order of complexity for classes with fixed widthq.