Envy-free Chore Division for An Arbitrary Number of Agents
暂无分享,去创建一个
Mohammad Taghi Hajiaghayi | Hadi Yami | Sina Dehghani | Alireza Farhadi | M. Hajiaghayi | Alireza Farhadi | Sina Dehghani | Hadi Yami
[1] Erel Segal-Halevi,et al. Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal , 2015, AAMAS.
[2] Ariel D. Procaccia,et al. Cake cutting: not just child's play , 2013, CACM.
[3] Oleg Pikhurko. On Envy-Free Cake Division , 2000, Am. Math. Mon..
[4] Costas Busch,et al. Hardness Results for Cake Cutting , 2005, Bull. EATCS.
[5] Elisha Peterson,et al. N-person envy-free chore division , 2009, 0909.0303.
[6] Haris Aziz,et al. Computational Social Choice: Some Current and New Directions , 2016, IJCAI.
[7] Haris Aziz,et al. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[8] Julius B. Barbanel,et al. Preference relations and measures in the context of fair division , 1995 .
[9] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[10] Ariel D. Procaccia,et al. How to Cut a Cake Before the Party Ends , 2013, AAAI.
[11] Ariel D. Procaccia. Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.
[12] Haris Aziz,et al. A discrete and bounded envy-free cake cutting protocol for four agents , 2015, STOC.
[13] Elisha Peterson,et al. Four-Person Envy-Free Chore Division , 2002 .
[14] Jörg Rothe,et al. Cake-Cutting: Fair Division of Divisible Goods , 2016, Economics and Computation.
[15] Ying Wang,et al. Cutting a Cake for Five People , 2009, AAIM.
[16] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[17] Egor Ianovski. Cake Cutting Mechanisms , 2012, ArXiv.
[18] William S. Zwicker,et al. A Moving-Knife Solution to the Four-Person Envy-Free Cake-Division Problem , 1995 .