Truthful fair division without free disposal.
作者： Warut Suksompong , Xiaohui Bei , Guangda Huzhang
DOI: 10.1007/S00355-020-01256-0
关键词:
摘要: … In particular, we show that for both cake cutting and chore division, no truthful and envy-free mechanism attains a better efficiency ratio than the mechanisms we presented in Sect. 3. …
arxiv.org
springer.com
harvard.edu
ijcai.org
sci-hub.st 参考文章(33)
Ariel D. Procaccia, Herve Moulin, Cake Cutting Algorithms Handbook of Computational Social Choice. pp. 311- 330 ,(2016) , 10.1017/CBO9781107446984.014
Elchanan Mossel, Omer Tamuz, Truthful fair division algorithmic game theory. pp. 288- 299 ,(2010) , 10.5555/1929237.1929262
Sandy Heydrich, Rob van Stee, Dividing connected chores fairly Theoretical Computer Science. ,vol. 593, pp. 51- 61 ,(2015) , 10.1016/J.TCS.2015.05.041
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)
Walter Stromquist, How to Cut a Cake Fairly American Mathematical Monthly. ,vol. 87, pp. 640- 644 ,(1980) , 10.1080/00029890.1980.11995109
Anna Bogomolnaia, Hervé Moulin, A New Solution to the Random Assignment Problem Journal of Economic Theory. ,vol. 100, pp. 295- 328 ,(2001) , 10.1006/JETH.2000.2710
L. E. Dubins, E. H. Spanier, How to Cut a Cake Fairly American Mathematical Monthly. ,vol. 68, pp. 1- 17 ,(1961) , 10.1080/00029890.1961.11989615