A graph theoretic approach to the slot allocation problem (Q2362198): Difference between revisions

@@ Property / cites work @@
+Probabilistic assignment of objects: characterizing the serial rule
+Normal rank
@@ Property / cites work @@
+A new solution to the random assignment problem.
@@ Property / cites work: A new solution to the random assignment problem. / rank @@
+Normal rank
@@ Property / cites work @@
+Random Matching Under Dichotomous Preferences
@@ Property / cites work: Random Matching Under Dichotomous Preferences / rank @@
+Normal rank
@@ Property / cites work @@
+Assigning agents to a line
@@ Property / cites work: Assigning agents to a line / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic assignment of indivisible goods with single-peaked preferences
+Normal rank
@@ Property / cites work @@
+A solution to the random assignment problem on the full preference domain
+Normal rank
@@ Property / cites work @@
+Incentives in landing slot problems
@@ Property / cites work: Incentives in landing slot problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
+Normal rank
@@ Property / cites work @@
+Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
+Normal rank
@@ Property / cites work @@
+Random assignment under weak preferences
@@ Property / cites work: Random assignment under weak preferences / rank @@
+Normal rank