We formally define the MARCH-MADNESS decision problem (inspired by popular betting pools for the NCAA basketball tournament), and prove it NP-complete.