id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_min2jdpukzaf5gkj3v2kj2he4q	Yiling Chen	Truth, justice, and cake cutting	2013	7	.pdf	application/pdf	6122	613	75	http://osc.hul.harvard.edu/dash/open-access-feedback?handle=&title=Truth,%20Justice,%20and%20Cake%20Cutting&community=1/1&collection=1/2&owningCollection1/2&harvardAuthors=8163de7d1727bd1a0850c7d9a608f710&departmentEngineering%20and%20Applied%20Sciences and randomized cake cutting algorithms that are truthful and view, an agent's valuation function is its private information, which is reported to a cake cutting algorithm. 4To be precise, previous algorithmic work assumed that the entire cake has to be allocated, but this does not seem to be a significant restriction in the context of fairness. A cake cutting algorithm is a function f from the valuation function of each agent to an allocation (A1, . A cake cutting algorithm f is truthful if when an agent bounded deterministic proportional and EF cake cutting algorithms for more than four agents, even if one is not concerned about strategic issues. if it allocates to each agent in S a piece of cake of length uniform valuations is a recursive algorithm that finds a subset of agents with a certain property, makes the allocation	./cache/work_min2jdpukzaf5gkj3v2kj2he4q.pdf	./txt/work_min2jdpukzaf5gkj3v2kj2he4q.txt