Small Clique Detection and Approximate Nash Equilibria

DOI10.1007/978-3-642-03685-9_50zbMath1255.68084OpenAlexW1497517366MaRDI QIDQ3638912

Dan Vilenchik, Lorenz Minder

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_50

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture ⋮ On the hardness of designing public signals ⋮ Inapproximability of NP-Complete Variants of Nash Equilibrium ⋮ Unnamed Item

This page was built for publication: Small Clique Detection and Approximate Nash Equilibria