Strategy-proof cake cutting mechanisms for all-or-nothing utility

Takamasa Ihara, Shunsuke Tsuruta, Taiki Todo, Yuko Sakurai, Makoto Yokoo

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

The cake cutting problem must fairly allocate a divisible good among agents who have varying preferences over it. Recently, designing strategy-proof cake cutting mechanisms has caught considerable attention from AI and MAS researchers. Previous works assumed that an agent’s utility function is additive so that theoretical analysis becomes tractable. However, in practice, agents have non-additive utility functions over a resource. In this paper, we consider the allor-nothing utility function as a representative example of non-additive utility because it can widely cover agents’ preferences for real-world resources, such as the usage of meeting rooms, time slots for computational resources, bandwidth usage, and so on. We first show the incompatibility between envy-freeness and Pareto efficiency when each agent has all-or-nothing utility. We next propose two strategy-proof mechanisms that satisfy Pareto efficiency, which are based on a serial dictatorship mechanism, at the sacrifice of envy-freeness. To address computational feasibility, we propose an approximation algorithm to find a near-optimal allocation in time polynomial in the number of agents, since the problem of finding a Pareto efficient allocation is NP-hard. As another approach that abandon Pareto efficiency, we develop an envy-free mechanism and show that one of our serial dictatorship based mechanisms satisfies proportionality in expectation, which is a weaker definition of proportionality. Finally, we evaluate the efficiency obtained by our proposed mechanisms by computational experiments.

本文言語英語
ホスト出版物のタイトルPRIMA 2015
ホスト出版物のサブタイトルPrinciples and Practice of Multi-Agent Systems - 18th International Conference, Proceedings
編集者Paolo Torroni, Andrea Omicini, Jane Hsu, Qingliang Chen, Paolo Torroni, Andrea Omicini, Jane Hsu, Qingliang Chen, Serena Villata, Serena Villata
出版社Springer Verlag
ページ118-133
ページ数16
ISBN(印刷版)9783319255231, 9783319255231
DOI
出版ステータス出版済み - 1 1 2015
イベント18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015 - Bertinoro, イタリア
継続期間: 10 26 201510 30 2015

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9387
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015
国/地域イタリア
CityBertinoro
Period10/26/1510/30/15

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Strategy-proof cake cutting mechanisms for all-or-nothing utility」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル