We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win–lose bimatrix games, deciding the existence of such uniform equilibria is an NP-complete problem. Our proof is graph-theoretical. Motivated by this result, we also give NPcompleteness results for the problems of finding reg...

The newly released MODIS Collection 6 aerosol products have been widely used to evaluate fine particulate matter with a 10 km Dark Target aerosol optic depth (DT AOD) product, a new 3 km DT AOD product and an enhanced Deep Blue (DB) AOD product. However, the representativeness of MODIS AOD products under different air quality conditions remains unclear. In this study, we obtained all three type...

We measure the impact of measurement error in labor-supply elasticities estimated over recalled usual work hours, as is ubiquitous in the literature. Employing hours of work in diaries collected by the American Time Use Survey, 2003-12, along with the same respondents’ recalled usual hours, we show that the latter yield elasticities that are positively biased. We argue that this bias arises fro...

This is an attempt of a new kind of anthropology, inspired by assumption that P is not NP, and, where anthropological field (experimental) study is considered as a search of a new complexity classes, in particularly, complexity class M.

In order to cooperate effectively with its peers, an agent must manipulate representations of the social structures in which it plays a part. The purpose of this paper is to investigate the mathematical and computational aspects of this social reasoning process. We begin by defining an abstract representation of cooperation structures, wherein agents cooperate to achieve goals on each other’s b...

z Sir, we are truly six special and interesting characters. Believe us. However we have gone lost. Abstract We consider the following six hypotheses: P = NP. SAT is truth-table reducible to a P-selective set. SAT is truth-table reducible to a k-approximable set for some k.

In this paper, we prove that there exists some condition, involving real functions, which implies P 6= NP .

SIX YEARS AGO, late in November, 1947, the Swedish research ship, the 1,450-ton motor schooner "Albatross," on its round-the-world cruise entered the harbor of Honolulu, where we had a magnificent reception. Two years later, in December, 1949, I was invited over here from the Mainland to give a preliminary survey ,of the main results of the cruise obtained through work in the Oceanographic Inst...

Are P and NP provably inseparable ? Take a look at some unorthodox, guilty mentioned folklore and related unpublished results.

This article is survey of recent developments in, and a tutorial on, the approach to P v. NP and related questions called Geometric Complexity Theory (GCT). It is written to be accessible to graduate students. Numerous open questions in algebraic geometry and representation theory relevant for GCT are presented.