5,823 research outputs found
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria
Over the years, researchers have studied the complexity of several decision
versions of Nash equilibrium in (symmetric) two-player games (bimatrix games).
To the best of our knowledge, the last remaining open problem of this sort is
the following; it was stated by Papadimitriou in 2007: find a non-symmetric
Nash equilibrium (NE) in a symmetric game. We show that this problem is
NP-complete and the problem of counting the number of non-symmetric NE in a
symmetric game is #P-complete.
In 2005, Kannan and Theobald defined the "rank of a bimatrix game"
represented by matrices (A, B) to be rank(A+B) and asked whether a NE can be
computed in rank 1 games in polynomial time. Observe that the rank 0 case is
precisely the zero sum case, for which a polynomial time algorithm follows from
von Neumann's reduction of such games to linear programming. In 2011, Adsul et.
al. obtained an algorithm for rank 1 games; however, it does not solve the case
of symmetric rank 1 games. We resolve this problem
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium
We present a direct reduction from k-player games to 2-player games that
preserves approximate Nash equilibrium. Previously, the computational
equivalence of computing approximate Nash equilibrium in k-player and 2-player
games was established via an indirect reduction. This included a sequence of
works defining the complexity class PPAD, identifying complete problems for
this class, showing that computing approximate Nash equilibrium for k-player
games is in PPAD, and reducing a PPAD-complete problem to computing approximate
Nash equilibrium for 2-player games. Our direct reduction makes no use of the
concept of PPAD, thus eliminating some of the difficulties involved in
following the known indirect reduction.Comment: 21 page
Trivial Excitation Energy Transfer to Carotenoids Is an Unlikely Mechanism for Non-photochemical Quenching in LHCII
Higher plants defend themselves from bursts of intense light via the mechanism of Non-Photochemical Quenching (NPQ). It involves the Photosystem II (PSII) antenna protein (LHCII) adopting a conformation that favors excitation quenching. In recent years several structural models have suggested that quenching proceeds via energy transfer to the optically forbidden and short-lived S(1) states of a carotenoid. It was proposed that this pathway was controlled by subtle changes in the relative orientation of a small number of pigments. However, quantum chemical calculations of S(1) properties are not trivial and therefore its energy, oscillator strength and lifetime are treated as rather loose parameters. Moreover, the models were based either on a single LHCII crystal structure or Molecular Dynamics (MD) trajectories about a single minimum. Here we try and address these limitations by parameterizing the vibronic structure and relaxation dynamics of lutein in terms of observable quantities, namely its linear absorption (LA), transient absorption (TA) and two-photon excitation (TPE) spectra. We also analyze a number of minima taken from an exhaustive meta-dynamical search of the LHCII free energy surface. We show that trivial, Coulomb-mediated energy transfer to S(1) is an unlikely quenching mechanism, with pigment movements insufficiently pronounced to switch the system between quenched and unquenched states. Modulation of S(1) energy level as a quenching switch is similarly unlikely. Moreover, the quenching predicted by previous models is possibly an artifact of quantum chemical over-estimation of S(1) oscillator strength and the real mechanism likely involves short-range interaction and/or non-trivial inter-molecular states
Structural Basis for Allosteric Regulation in the Major Antenna Trimer of Photosystem II
The allosteric regulation of protein function proves important in many life-sustaining processes. In plant photosynthesis, LHCII, the major antenna complex of Photosystem II, employs a delicate switch between light harvesting and photoprotective modes. The switch is triggered by an enlarged pH gradient (ΔpH) across the thylakoid membranes. Using molecular simulations and quantum calculations, we show that ΔpH can tune the light-harvesting potential of the antenna via allosteric regulation of the excitonic coupling in chlorophyll-carotenoid pairs. To this end, we propose how the LHCII excited state lifetime is coupled to the environmental conditions. In line with experimental findings, our theoretical model provides crucial evidence toward the elucidation of the photoprotective switch of higher plants at an all-atom resolution
Sampling correctors
In many situations, sample data is obtained from a noisy or imperfect source. In order to address such corruptions, this paper introduces the concept of a sampling corrector. Such algorithms use structure that the distribution is purported to have, in order to allow one to make "on-the-fly" corrections to samples drawn from probability distributions. These algorithms then act as filters between the noisy data and the end user.
We show connections between sampling correctors, distribution learning algorithms, and distribution property testing algorithms. We show that these connections can be utilized to expand the applicability of known distribution learning and property testing algorithms as well as to achieve improved algorithms for those tasks. As a first step, we show how to design sampling correctors using proper learning algorithms. We then focus on the question of whether algorithms for sampling correctors can be more efficient in terms of sample complexity than learning algorithms for the analogous families of distributions. When correcting monotonicity, we show that this is indeed the case when also granted query access to the cumulative distribution function. We also obtain sampling correctors for monotonicity without this stronger type of access, provided that the distribution be originally very close to monotone (namely, at a distance O(1/log2 n)). In addition to that, we consider a restricted error model that aims at capturing "missing data" corruptions. In this model, we show that distributions that are close to monotone have sampling correctors that are significantly more efficient than achievable by the learning approach. We then consider the question of whether an additional source of independent random bits is required by sampling correctors to implement the correction process. We show that for correcting close-to-uniform distributions and close-to-monotone distributions, no additional source of random bits is required, as the samples from the input source itself can be used to produce this randomness
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple
stochastic multiplayer games. We show that restricting the search space to
equilibria whose payoffs fall into a certain interval may lead to
undecidability. In particular, we prove that the following problem is
undecidable: Given a game G, does there exist a pure-strategy Nash equilibrium
of G where player 0 wins with probability 1. Moreover, this problem remains
undecidable if it is restricted to strategies with (unbounded) finite memory.
However, if mixed strategies are allowed, decidability remains an open problem.
One way to obtain a provably decidable variant of the problem is restricting
the strategies to be positional or stationary. For the complexity of these two
problems, we obtain a common lower bound of NP and upper bounds of NP and
PSPACE respectively.Comment: 23 pages; revised versio
A de novo 2.9 Mb interstitial deletion at 13q12.11 in a child with developmental delay accompanied by mild dysmorphic characteristics
Background: Proximal deletions in the 13q12.11 region are very rare. Much larger deletions including this region have been described and are associated with complex phenotypes of mental retardation, developmental delay and various others anomalies. Results: We report on a 3-year-old girl with a rare 2.9 Mb interstitial deletion at 13q12.11 due to a de novo unbalanced t(13;14) translocation. She had mild mental retardation and relatively mild dysmorphic features such as microcephaly, flat nasal bridge, moderate micrognathia and clinodactyly of 5th finger. Molecular karyotyping revealed a deletion on the long arm of chromosome 13 as involving sub-bands 13q12.11, a deletion of about 2.9 Mb. Discussion: The clinical application of array-CGH has made it possible to detect submicroscopical genomic rearrangements that are associated with varying phenotypes.The description of more patients with deletions of the 13q12.11 region will allow a more precise genotype-phenotype correlation
Inapproximability Results for Approximate Nash Equilibria.
We study the problem of finding approximate Nash equilibria that satisfy
certain conditions, such as providing good social welfare. In particular, we
study the problem -NE -SW: find an -approximate
Nash equilibrium (-NE) that is within of the best social
welfare achievable by an -NE. Our main result is that, if the
exponential-time hypothesis (ETH) is true, then solving -NE -SW for an
bimatrix game requires time. Building
on this result, we show similar conditional running time lower bounds on a
number of decision problems for approximate Nash equilibria that do not involve
social welfare, including maximizing or minimizing a certain player's payoff,
or finding approximate equilibria contained in a given pair of supports. We
show quasi-polynomial lower bounds for these problems assuming that ETH holds,
where these lower bounds apply to -Nash equilibria for all . The hardness of these other decision problems has so far only
been studied in the context of exact equilibria.Comment: A short (14-page) version of this paper appeared at WINE 2016.
Compared to that conference version, this new version improves the
conditional lower bounds, which now rely on ETH rather than RETH (Randomized
ETH
- …