资源分类
》 资源 》论文》Online Fair Division: Analysing a Food Bank Problem

Online Fair Division: Analysing a Food Bank Problem

2019-11-19 | |  58 |   46 |   0
Abstract We study an online model of fair division designed to capture features of a real world charity problem. We consider two simple mechanisms for this model in which agents simply declare what items they like. We analyse axiomatic properties of these mechanisms such as strategy-proofness and envy freeness. Finally, we perform a competitive analysis and compute the price of anarchy.

上一篇：Looking at Mondrian’s Victory Boogie-Woogie: What Do I Feel?

下一篇：A Personalised Thermal Comfort Model using a Bayesian Network

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...