Embedded antichains in tournaments

The maximum antichain cardinality (MACC) of a tournament is the maximum number of incomparable subtournaments of T. We establish some properties of MACC. We describe all tournaments whose MACC is 1 or 2, show that MACC can grow exponentially with the size of the vertex set of a tournament, and present some questions for further investigation.