On parameterized complexity of binary networked public goods game (Q6185945): Difference between revisions

@@ Property / cites work @@
+Public goods in networks
@@ Property / cites work: Public goods in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing a Nash Equilibrium
@@ Property / cites work: The Complexity of Computing a Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Network Games
@@ Property / cites work: Network Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q5715720
@@ Property / cites work: Q5715720 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
+Normal rank
@@ Property / cites work @@
+Q3524716
@@ Property / cites work: Q3524716 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3524733
@@ Property / cites work: Q3524733 / rank @@
+Normal rank
@@ Property / cites work @@
+Incentive-based search for efficient equilibria of the public goods game
+Normal rank
@@ Property / cites work @@
+Contagion
@@ Property / cites work: Contagion / rank @@
+Normal rank
@@ Property / cites work @@
+Tractable cases of the extended global cardinality constraint
+Normal rank