Maximizing Nash Product Social Welfare in Allocating Indivisible Goods
暂无分享,去创建一个
[1] Cristopher Moore,et al. Hard Tiling Problems with Simple Tiles , 2001, Discret. Comput. Geom..
[2] F. Brandt,et al. Computational Social Choice: Prospects and Challenges , 2011, FET.
[3] Jörg Rothe,et al. Computational complexity and approximability of social welfare optimization in multiagent resource allocation , 2012, Autonomous Agents and Multi-Agent Systems.
[4] Ulrich Endriss,et al. Nash Social Welfare in Multiagent Resource Allocation , 2009, AMEC/TADA.
[5] D. Golovin. Max-min fair allocation of indivisible goods , 2005 .
[6] Carles Sierra,et al. Agent-Mediated Electronic Commerce , 2004, Autonomous Agents and Multi-Agent Systems.
[7] Hervé Moulin,et al. Fair division and collective welfare , 2003 .
[8] Yann Chevaleyre,et al. Issues in Multiagent Resource Allocation , 2006, Informatica.
[9] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[10] Nikhil Bansal,et al. The Santa Claus problem , 2006, STOC '06.
[11] Peter C. Fishburn,et al. FAIR DIVISION OF INDIVISIBLE ITEMS , 2003 .
[12] Yann Chevaleyre,et al. Multiagent resource allocation in k-additive domains: preference representation and complexity , 2008, Ann. Oper. Res..
[13] Peter C. Fishburn,et al. Chapter 4 Voting procedures , 2002 .
[14] Jörg Rothe,et al. Scoring Rules for the Allocation of Indivisible Goods , 2014, ECAI.
[15] Michael Wooldridge,et al. The complexity of contract negotiation , 2005, Artif. Intell..
[16] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[17] Jörg Rothe,et al. Complexity of social welfare optimization in multiagent resource allocation , 2010, AAMAS.