A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents | IEEE Conference Publication | IEEE Xplore