关键词: 蛋糕分配, 无嫉妒, 风险寻求, 风险厌恶

Abstract: It is studied that how much benefit an agent can obtain by his misreport in any envy-free cake cutting algorithm. Two types of agents, risk-seeking and risk-averse, are considered, and the value density function is restricted to piecewise constant. It can be showed that an agent cannot be benefited by misreporting if he is risk-seeking or risk-averse. If considering allocations with only [n-1] cuts on the cake, the utility gain from misreporting can be as much as [Θ(n)].

Key words: cake cutting, envy-free, risk-seeking, risk-averse