We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
Moses Charikar, Konstantin Makarychev, Yury Makary...
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...