Computing Stable Outcomes in Hedonic Games (Q3162517): Difference between revisions

@@ Property / cites work @@
+Q4339078
@@ Property / cites work: Q4339078 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness in hedonic games
@@ Property / cites work: NP-completeness in hedonic games / rank @@
+Normal rank
@@ Property / cites work @@
+The stability of hedonic coalition structures
@@ Property / cites work: The stability of hedonic coalition structures / rank @@
+Normal rank
@@ Property / cites work @@
+Coalition formation games with separable preferences.
+Normal rank
@@ Property / cites work @@
+Convergence and Approximation in Potential Games
@@ Property / cites work: Convergence and Approximation in Potential Games / rank @@
+Normal rank
@@ Property / cites work @@
+Hedonic Coalitions: Optimality and Stability
@@ Property / cites work: Hedonic Coalitions: Optimality and Stability / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+On the Power of Nodes of Degree Four in the Local Max-Cut Problem
+Normal rank
@@ Property / cites work @@
+Local Search: Simple, Successful, But Sometimes Sluggish
+Normal rank
@@ Property / cites work @@
+Approximate Local Search in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Simple Local Search Problems that are Hard to Solve
+Normal rank
@@ Property / cites work @@
+Q3392275
@@ Property / cites work: Q3392275 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity in additive hedonic games
+Normal rank