Computational complexity of necessary envy-freeness (Q6125946): Difference between revisions

@@ Property / cites work @@
+Simultaneously achieving ex-ante and ex-post fairness
+Normal rank
@@ Property / cites work @@
+Fair assignment of indivisible objects under ordinal preferences
+Normal rank
@@ Property / cites work @@
+Fair Allocation of Indivisible Goods
@@ Property / cites work: Fair Allocation of Indivisible Goods / rank @@
+Normal rank
@@ Property / cites work @@
+Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
+Normal rank
@@ Property / cites work @@
+Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
+Normal rank
@@ Property / cites work @@
+Q4338900
@@ Property / cites work: Q4338900 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank