The current generation of CASE tools mainly provides rigid and unnexible support for editing, storage, veriication and transformation of speciications. Information engineers have to adapt their way of working to CASE tools instead of vice versa. To enable a more exi-ble, method independent, support of information engineers, the concept of a CASE shell has emerged. Crucial for CASE shells is the...

We study classic cake-cutting problems, but in discrete models rather than using infiniteprecision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and movingknife), we roughly partition the various fair-allocation problems into 3 classes: “easy” (constant number of rounds of logar...

We consider the classic cake-divison problem when the cake is a heterogeneous good represented by an interval in the real line. We provide a mechanism to implement, in an anonymous way, an envy-free and e¢cient allocation when agents have private information on their preferences. The mechanism is a multistep sequential game form in which each agent at each step receives a morsel of the cake tha...