Random scheduling with deadlines under dichotomous preferences (Q898667): Difference between revisions

@@ Property / DOI @@
-.1016/j.jmateco.2015.08.001
@@ Property / DOI: 10.1016/j.jmateco.2015.08.001 / 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.jmateco.2015.08.001
+Normal rank
@@ Property / OpenAlex ID @@
+W1150962216
@@ Property / OpenAlex ID: W1150962216 / rank @@
+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 @@
+A simple random assignment problem with a unique solution
+Normal rank
@@ Property / cites work @@
+Random Matching Under Dichotomous Preferences
@@ Property / cites work: Random Matching Under Dichotomous Preferences / rank @@
+Normal rank
@@ Property / cites work @@
+Consistency in the probabilistic assignment model
@@ Property / cites work: Consistency in the probabilistic assignment model / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with Opting Out: Improving upon Random Priority
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JMATECO.2015.08.001
@@ Property / DOI: 10.1016/J.JMATECO.2015.08.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:898667