Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
暂无分享,去创建一个
Haris Aziz | Chun Ye | H. Aziz | Chun Ye
[1] W. Marsden. I and J , 2012 .
[2] Robert E. Tarjan,et al. A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..
[3] Yuan Tian,et al. Strategy-Proof and Efficient Offline Interval Scheduling and Cake Cutting , 2013, WINE.
[4] Noam Nisan,et al. Incentive Compatible Two Player Cake Cutting , 2012, WINE.
[5] Ariel D. Procaccia,et al. Truth, justice, and cake cutting , 2010, Games Econ. Behav..
[6] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[7] Hervé Moulin,et al. A New Solution to the Random Assignment Problem , 2001, J. Econ. Theory.
[8] William Thomson,et al. Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey , 2003, Math. Soc. Sci..
[9] Steven J. Brams,et al. Proportional pie-cutting , 2008, Int. J. Game Theory.
[10] Nikhil R. Devanur,et al. Market equilibrium via a primal--dual algorithm for a convex program , 2008, JACM.
[11] Felix Brandt,et al. Pareto optimality in coalition formation , 2011, Games Econ. Behav..
[12] Ariel D. Procaccia,et al. Optimal Envy-Free Cake Cutting , 2011, AAAI.
[13] Anna Bogomolnaia,et al. Random Matching and assignment under dichotomous preferences , 2001 .
[14] J. Schummer. Strategy-proofness versus efficiency on restricted domains of exchange economies , 1996 .
[15] Felix Brandt,et al. The Computational Complexity of Random Serial Dictatorship , 2013, WINE.
[16] Lin Zhou. On a conjecture by gale about one-sided matching problems , 1990 .
[17] W. Thomson. Children Crying at Birthday Parties. Why? , 2007 .
[18] Jay Sethuraman,et al. House allocation with fractional endowments , 2011, Int. J. Game Theory.
[19] D. Weller,et al. Fair division of a measurable space , 1985 .
[20] Hans Reijnierse,et al. On finding an envy-free Pareto-optimal division , 1998, Math. Program..
[21] Elchanan Mossel,et al. Truthful Fair Division , 2010, SAGT.
[22] Hervé Moulin,et al. Fair division and collective welfare , 2003 .
[23] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[24] Daniela Sabán,et al. The Complexity of Computing the Random Priority Allocation Matrix , 2013, Math. Oper. Res..
[25] Steven J. Brams,et al. Mathematics and democracy: Designing better voting and fair-division procedures , 2008, Math. Comput. Model..
[26] Jay Sethuraman,et al. A solution to the random assignment problem on the full preference domain , 2006, J. Econ. Theory.
[27] Özgür Yilmaz,et al. Random assignment under weak preferences , 2009, Games Econ. Behav..
[28] H. Peyton Young,et al. Equity - in theory and practice , 1994 .
[29] Ariel D. Procaccia,et al. On Maxsum Fair Cake Divisions , 2012, AAAI.
[30] F. Su. Rental Harmony: Sperner's Lemma in Fair Division , 1999 .
[31] I. D. Hill. Mathematics and Democracy: Designing Better Voting and Fair‐division Procedures , 2008 .
[32] H. Moulin,et al. Random Matching under Dichotomous Preferences , 2004 .
[33] Miroslav Dudík,et al. Reducing Untruthful Manipulation in Envy-Free Pareto Optimal Resource Allocation , 2010, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.
[34] Fuhito Kojima,et al. Random assignment of multiple indivisible objects , 2009, Math. Soc. Sci..
[35] Ariel D. Procaccia,et al. Cake cutting: not just child's play , 2013, CACM.
[36] V. Vazirani. Algorithmic Game Theory: Combinatorial Algorithms for Market Equilibria , 2007 .
[37] Hervé Moulin,et al. Scheduling with Opting Out: Improving upon Random Priority , 2001, Oper. Res..
[38] Christopher P. Chambers. Consistency in the probabilistic assignment model , 2004 .
[39] W. Stromquist. How to Cut a Cake Fairly , 1980 .