NP-completeness in hedonic games (Q1886742): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.geb.2003.10.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2070069359
@@ Property / OpenAlex ID: W2070069359 / rank @@
+Normal rank
@@ Property / cites work @@
+Core in a simple coalition formation game
@@ Property / cites work: Core in a simple coalition formation game / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing a best response automaton in repeated games with mixed strategies
+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 @@
+Q3589189
@@ Property / cites work: Q3589189 / rank @@
+Normal rank
@@ Property / cites work @@
+Farsighted stability in hedonic games
@@ Property / cites work: Farsighted stability in hedonic 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 @@
+Computing the nucleolus of min-cost spanning tree games is NP-hard.
+Normal rank
@@ Property / cites work @@
+On the complexity of testing membership in the core of min-cost spanning tree games
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing best-response automata in repeated games
+Normal rank
@@ Property / cites work @@
+Q3995616
@@ Property / cites work: Q3995616 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the “stable roommates” problem
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Minesweeper is NP-complete.
@@ Property / cites work: Minesweeper is NP-complete. / rank @@
+Normal rank