1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.PR2005★ 1 cited
Slow Emergence of Cooperation for Win-Stay Lose-Shift on Trees
Elchanan Mossel, Sebastien Roch
We consider a group of agents on a graph who repeatedly play the prisoner's dilemma game against their neighbors. The players adapt their actions to the past behavior of their oppo…
cs.CC2005
Conditional Hardness for Approximate Coloring
Irit Dinur, Elchanan Mossel, Oded Regev
We study the coloring problem: Given a graph G, decide whether or , where c(G) is the chromatic number of G. We derive conditional hardness for this probl…