Latest YouTube Video

Wednesday, April 13, 2016

A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. (arXiv:1604.03655v1 [cs.DS])

We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from the agents. The problem has received attention in computer science, mathematics, and economics. It has been a major open problem whether there exists a bounded and discrete envy-free protocol. We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents.



from cs.AI updates on arXiv.org http://ift.tt/1Q85mzr
via IFTTT

No comments: