Cake Cutting: Envy and Truth
作者： Xiaohui Bei , Ning Chen , Guangda Huzhang , Biaoshuai Tao , Jiajun Wu
关键词: Economics
摘要:
ijcai.org
sci-hub.st 参考文章(24)
Hervé Moulin, Fair Division and Collective Welfare ,(2003)
Haris Aziz, Chun Ye, Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations workshop on internet and network economics. pp. 1- 14 ,(2014) , 10.1007/978-3-319-13129-0_1
Haris Aziz, Simon Mackenzie, A discrete and bounded envy-free cake cutting protocol for four agents symposium on the theory of computing. pp. 454- 464 ,(2016) , 10.1145/2897518.2897522
Avishay Maya, Noam Nisan, Incentive compatible two player cake cutting workshop on internet and network economics. pp. 170- 183 ,(2012) , 10.1007/978-3-642-35311-6_13
Jack Robertson, William Webb, Cake Cutting Algorithms: Be Fair If You Can ,(1998)
Frank Kelly, Charging and rate control for elastic traffic European Transactions on Telecommunications. ,vol. 8, pp. 33- 37 ,(1997) , 10.1002/ETT.4460080106
Ariel D. Procaccia, Cake cutting: not just child's play Communications of The ACM. ,vol. 56, pp. 78- 87 ,(2013) , 10.1145/2483852.2483870
John F. Nash, The Bargaining Problem Econometrica. ,vol. 18, pp. 155- 162 ,(1950) , 10.2307/1907266
Steven J. Brams, Alan D. Taylor, Fair Division: From Cake-Cutting to Dispute Resolution ,(1996)
Matthew O. Jackson, Incentive compatibility and competitive allocations Economics Letters. ,vol. 40, pp. 299- 302 ,(1992) , 10.1016/0165-1765(92)90008-M