Fair Allocation of Multiple Resources Using a Non-monetary Allocation Mechanism
暂无分享,去创建一个
[1] Chris Arney. Mathematics and Democracy: The Case for Quantitative Literacy , 2002 .
[2] Steven J. Brams,et al. The undercut procedure: an algorithm for the envy-free division of indivisible items , 2009, Soc. Choice Welf..
[3] Peter C. Fishburn,et al. Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity , 2000, Soc. Choice Welf..
[4] Hervé Moulin,et al. Fair division and collective welfare , 2003 .
[5] YangSichao,et al. VCG-Kelly Mechanisms for Allocation of Divisible Goods , 2007 .
[6] Clemens Puppe,et al. A simple procedure for finding equitable allocations of indivisible goods , 2002, Soc. Choice Welf..
[7] Jean C. Walrand,et al. An efficient Nash-implementation mechanism for network resource allocation , 2010, Autom..
[8] Vijay V. Vazirani,et al. Allocation of Divisible Goods Under Lexicographic Preferences , 2012, FSTTCS.
[9] Srikrishna Bhashyam,et al. Almost budget-balanced mechanisms for allocation of divisible resources , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[10] Bruce Hajek,et al. VCG-Kelly Mechanisms for Allocation of Divisible Goods: Adapting VCG Mechanisms to One-Dimensional Signals , 2006 .