  We prove a "multiple colored Tverberg theorem" and a "balanced colored
Tverberg theorem", by applying different methods, tools and ideas. The proof of
the first theorem uses multiple chessboard complexes (as configuration spaces)
and Eilenberg-Krasnoselskii theory of degrees of equivariant maps for non-free
actions. The proof of the second result relies on high connectivity of the
configuration space, established by discrete Morse theory.
