How to allocate hard candies fairly (Q2463574): Difference between revisions

@@ Property / author @@
-Marco Dall'Aglio
@@ Property / author: Marco Dall'Aglio / rank @@
-Normal rank
@@ Property / author @@
+Marco Dall'Aglio
@@ Property / author: Marco Dall'Aglio / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.mathsocsci.2007.04.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2044778404
@@ Property / OpenAlex ID: W2044778404 / rank @@
+Normal rank
@@ Property / cites work @@
+Vilfredo Pareto cuts the cake
@@ Property / cites work: Vilfredo Pareto cuts the cake / rank @@
+Normal rank
@@ Property / cites work @@
+Fair division of indivisible items
@@ Property / cites work: Fair division of indivisible items / rank @@
+Normal rank
@@ Property / cites work @@
+Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
+Normal rank
@@ Property / cites work @@
+Q5450059
@@ Property / cites work: Q5450059 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4338900
@@ Property / cites work: Q4338900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable distribution of indivisible objects
@@ Property / cites work: Equitable distribution of indivisible objects / rank @@
+Normal rank
@@ Property / cites work @@
+A simple procedure for finding equitable allocations of indivisible goods
+Normal rank
@@ Property / cites work @@
+Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods
+Normal rank
@@ Property / cites work @@
+Q5616617
@@ Property / cites work: Q5616617 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank