资源分类
》 资源 》论文》On the Complexity of Chore Division

On the Complexity of Chore Division

2019-11-05 | |  53 |   38 |   0
Abstract We study the proportional chore division problem where a protocol wants to divide an undesirable object, called chore, among n different players. This problem is the dual variant of the cake cutting problem in which we want to allocate a desirable object. In this paper, we show that chore division and cake cutting problems are closely related to each other and provide a tight lower bound for proportional chore division.

上一篇：Opinion Diffusion and Campaigning on Society Graphs

下一篇：Trembling-Hand Perfection in Extensive-Form Games with Commitment

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...