In the classic cake-cutting problem (Steinhaus, 1948), a heterogeneous resource has to be divided among n agents with different valuations in a proportional way — giving each agent a piece with a value of at least 1/n of the total. In many applications, such as dividing a land-estate or a time-interval, it is also important that the pieces are connected. We propose two additional requirements: ...

This paper considers Nash implementation and double implementation of Pareto efficient allocations for production economies. We allow production sets and preferences are unknown to the planner. We present a well-behaved mechanism that fully implements Pareto efficient allocations in Nash equilibrium. The mechanism then is modified to fully doubly implement Pareto efficient allocations in Nash a...

In this paper we show that in pure exchange economies there exists no Pareto efficient and strategy-proof allocation mechanism which ensures positive consumptions to all agents. We also show that Pareto efficient, strategy-proof, and non-bossy allocation mechanism is dictatorial. We further show that if there exists three agents, then the allocation given by a Pareto efficient, strategy-proof, ...