most citedEfficiently Computing Nash Equilibria in Adversarial Team Markov Games

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2016

Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics

Moses Charikar, Vaggos Chatziafratis

Dasgupta recently introduced a cost function for the hierarchical clustering of a set of points given pairwise similarities between them. He showed that this function is NP-hard to…