Knowledge, Fairness, and Social Constraints
暂无分享,去创建一个
Ioannis Caragiannis | Jérôme Lang | Haris Aziz | Sylvain Bouveret | Ira Giagkousi | J. Lang | I. Caragiannis | H. Aziz | S. Bouveret | Ira Giagkousi
[1] Yann Chevaleyre,et al. Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.
[2] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[3] Jon M. Kleinberg,et al. Fair Division via Social Comparison , 2016, AAMAS.
[4] Jörg Rothe,et al. Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods , 2014, Discret. Appl. Math..
[5] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[6] Ariel D. Procaccia. Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.
[7] Eric Budish,et al. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.
[8] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2019, ACM Trans. Economics and Comput..
[9] Yann Chevaleyre,et al. Distributed fair allocation of indivisible goods , 2017, Artif. Intell..
[10] Sylvain Bouveret,et al. Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.
[11] Edith Elkind,et al. Fair Division of a Graph , 2017, IJCAI.
[12] Youming Qiao,et al. Networked Fairness in Cake Cutting , 2017, IJCAI.
[13] Yann Chevaleyre,et al. Issues in Multiagent Resource Allocation , 2006, Informatica.
[14] Yiling Chen,et al. Ignorance is Often Bliss : Envy with Incomplete Information , 2017 .
[15] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[16] Tim Roughgarden,et al. Almost Envy-Freeness with General Valuations , 2017, SODA.