| Abstract: | Let the cake be represented by the unit interval of reals, with two players having possibly different valuations. We propose a finite algorithm that produces contiguous pieces for both players such that their values differ by at most ?, where ??>?0 is a given small number. Players are not required to reveal their complete value functions, they only have to announce the bisection points of a sequence of intervals. If both utility functions are everywhere positive then the algorithm converges to the unique equitable point. |
