Klaus, Kultti; Hannu, Vartiainen - In: The B.E. Journal of Theoretical Economics 7 (2007) 1, pp. 1-26
We apply the von Neumann-Morgenstern stable set to the n-player cake division problem. Only time-preferences á la Rubinstein (1982) are assumed. The stable set is defined with respect to the following dominance relation: x dominates y if there is a player who prefers x over y even with one...