![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Reference Work Entry In depth
Matching Market Equilibrium Algorithms
-
Reference Work Entry In depth
Non-approximability of Bimatrix Nash Equilibria
-
Reference Work Entry In depth
Complexity of Bimatrix Nash Equilibria
-
Reference Work Entry In depth
Trial and Error Algorithms
-
Reference Work Entry In depth
Incentive Compatible Selection
-
Reference Work Entry In depth
Robustness in Self-Assembly
-
Reference Work Entry In depth
Vertex Cover Kernelization
-
Reference Work Entry In depth
Sphere Packing Problem
-
Reference Work Entry In depth
Vertex Cover Search Trees
-
Reference Work Entry In depth
Complexity Dichotomies for Counting Graph Homomorphisms
-
Living Reference Work Entry In depth
Complexity of Bimatrix Nash Equilibria
-
Living Reference Work Entry In depth
Incentive Compatible Selection
-
Living Reference Work Entry In depth
Trial and Error Algorithms
-
Living Reference Work Entry In depth
Robustness in Self-Assembly
-
Living Reference Work Entry In depth
Matching Market Equilibrium Algorithms
-
Living Reference Work Entry In depth
Complexity Dichotomies for Counting Graph Homomorphisms
-
Reference Work Entry In depth
Vertex Cover Kernelization
-
Reference Work Entry In depth
Sphere Packing Problem
-
Reference Work Entry In depth
Vertex Cover Search Trees
-
Reference Work Entry In depth
Incentive Compatible Selection