101 citations · 355 across the 29 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011★ 51 cited
The complexity of conservative valued CSPs
Vladimir Kolmogorov, Stanislav Zivny
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fixed set of cost functions over…
cs.GT2011★ 2 cited
Optimal Coalition Structures in Cooperative Graph Games
Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov +1
Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inherent tradeoff between how general a language is, allowing it to c…