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

Strong coupling in the far-infrared between graphene plasmons and the surface optical phonons of silicon dioxide

This is the author accepted manuscript. The final version is available from American Chemical Society via the DOI in this record.We study plasmonic resonances in electrostatically gated graphene nanoribbons on silicon dioxide substrates. Absorption spectra are measured in the mid-far infrared and reveal multiple peaks, with width-dependent resonant frequencies. We calculate the dielectric function within the random phase approximation and show that the observed spectra can be explained by surface-plasmon-phonon-polariton modes, which arise from coupling of the graphene plasmon to three surface optical phonon modes in the silicon dioxide.This research was supported by the UK Engineering and Physical Sciences Research Council, via the award of a Fellowship in Frontier Manufacturing (EP/J018651/1) to G.N., and the European Union under the FET-open grant GOSFEL

Identification of Giardia lamblia DHHC Proteins and the Role of Protein S-palmitoylation in the Encystation Process

Protein S-palmitoylation, a hydrophobic post-translational modification, is performed by protein acyltransferases that have a common DHHC Cys-rich domain (DHHC proteins), and provides a regulatory switch for protein membrane association. In this work, we analyzed the presence of DHHC proteins in the protozoa parasite Giardia lamblia and the function of the reversible S-palmitoylation of proteins during parasite differentiation into cyst. Two specific events were observed: encysting cells displayed a larger amount of palmitoylated proteins, and parasites treated with palmitoylation inhibitors produced a reduced number of mature cysts. With bioinformatics tools, we found nine DHHC proteins, potential protein acyltransferases, in the Giardia proteome. These proteins displayed a conserved structure when compared to different organisms and are distributed in different monophyletic clades. Although all Giardia DHHC proteins were found to be present in trophozoites and encysting cells, these proteins showed a different intracellular localization in trophozoites and seemed to be differently involved in the encystation process when they were overexpressed. dhhc transgenic parasites showed a different pattern of cyst wall protein expression and yielded different amounts of mature cysts when they were induced to encyst. Our findings disclosed some important issues regarding the role of DHHC proteins and palmitoylation during Giardia encystation.Fil: Merino, Maria Cecilia. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra. Universidad Nacional de Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra; ArgentinaFil: Zamponi, Nahuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra. Universidad Nacional de Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra; ArgentinaFil: Vranych, Cecilia Verónica. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra. Universidad Nacional de Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra; ArgentinaFil: Touz, Maria Carolina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra. Universidad Nacional de Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra; ArgentinaFil: Ropolo, Andrea Silvana. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra. Universidad Nacional de Córdoba. Instituto de Investigación Médica Mercedes y Martín Ferreyra; Argentin

Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra's algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms' behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum's behavior, finding the minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

Evidence for the Rare Decay B -> K*ll and Measurement of the B -> Kll Branching Fraction

We present evidence for the flavor-changing neutral current decay $B\to K^*\ell^+\ell^-$ and a measurement of the branching fraction for the related process $B\to K\ell^+\ell^-$, where $\ell^+\ell^-$ is either an $e^+e^-$ or $\mu^+\mu^-$ pair. These decays are highly suppressed in the Standard Model, and they are sensitive to contributions from new particles in the intermediate state. The data sample comprises $123\times 10^6$ $\Upsilon(4S)\to B\bar{B}$ decays collected with the Babar detector at the PEP-II $e^+e^-$ storage ring. Averaging over $K^{(*)}$ isospin and lepton flavor, we obtain the branching fractions ${\mathcal B}(B\to K\ell^+\ell^-)=(0.65^{+0.14}_{-0.13}\pm 0.04)\times 10^{-6}$ and ${\mathcal B}(B\to K^*\ell^+\ell^-)=(0.88^{+0.33}_{-0.29}\pm 0.10)\times 10^{-6}$, where the uncertainties are statistical and systematic, respectively. The significance of the $B\to K\ell^+\ell^-$ signal is over $8\sigma$, while for $B\to K^*\ell^+\ell^-$ it is $3.3\sigma$.Comment: 7 pages, 2 postscript figues, submitted to Phys. Rev. Let

Measurement of Branching Fraction and Dalitz Distribution for B0->D(*)+/- K0 pi-/+ Decays

We present measurements of the branching fractions for the three-body decays B0 -> D(*)-/+ K0 pi^+/-$and their resonant submodes$B0 -> D(*)-/+ K*+/- using a sample of approximately 88 million BBbar pairs collected by the BABAR detector at the PEP-II asymmetric energy storage ring. We measure: B(B0->D-/+ K0 pi+/-)=(4.9 +/- 0.7(stat) +/- 0.5 (syst)) 10^{-4} B(B0->D*-/+ K0 pi+/-)=(3.0 +/- 0.7(stat) +/- 0.3 (syst)) 10^{-4} B(B0->D-/+ K*+/-)=(4.6 +/- 0.6(stat) +/- 0.5 (syst)) 10^{-4} B(B0->D*-/+ K*+/-)=(3.2 +/- 0.6(stat) +/- 0.3 (syst)) 10^{-4} From these measurements we determine the fractions of resonant events to be : f(B0-> D-/+ K*+/-) = 0.63 +/- 0.08(stat) +/- 0.04(syst) f(B0-> D*-/+ K*+/-) = 0.72 +/- 0.14(stat) +/- 0.05(syst)Comment: 7 pages, 3 figures submitted to Phys. Rev. Let

Search for direct production of charginos and neutralinos in events with three leptons and missing transverse momentum in √s = 7 TeV pp collisions with the ATLAS detector

A search for the direct production of charginos and neutralinos in final states with three electrons or muons and missing transverse momentum is presented. The analysis is based on 4.7 fb−1 of proton–proton collision data delivered by the Large Hadron Collider and recorded with the ATLAS detector. Observations are consistent with Standard Model expectations in three signal regions that are either depleted or enriched in Z-boson decays. Upper limits at 95% confidence level are set in R-parity conserving phenomenological minimal supersymmetric models and in simplified models, significantly extending previous results

Observation of associated near-side and away-side long-range correlations in √sNN=5.02 TeV proton-lead collisions with the ATLAS detector

Two-particle correlations in relative azimuthal angle (Δϕ) and pseudorapidity (Δη) are measured in √sNN=5.02  TeV p+Pb collisions using the ATLAS detector at the LHC. The measurements are performed using approximately 1  μb-1 of data as a function of transverse momentum (pT) and the transverse energy (ΣETPb) summed over 3.1<η<4.9 in the direction of the Pb beam. The correlation function, constructed from charged particles, exhibits a long-range (2<|Δη|<5) “near-side” (Δϕ∼0) correlation that grows rapidly with increasing ΣETPb. A long-range “away-side” (Δϕ∼π) correlation, obtained by subtracting the expected contributions from recoiling dijets and other sources estimated using events with small ΣETPb, is found to match the near-side correlation in magnitude, shape (in Δη and Δϕ) and ΣETPb dependence. The resultant Δϕ correlation is approximately symmetric about π/2, and is consistent with a dominant cos⁡2Δϕ modulation for all ΣETPb ranges and particle pT

Single hadron response measurement and calorimeter jet energy scale uncertainty with the ATLAS detector at the LHC

The uncertainty on the calorimeter energy response to jets of particles is derived for the ATLAS experiment at the Large Hadron Collider (LHC). First, the calorimeter response to single isolated charged hadrons is measured and compared to the Monte Carlo simulation using proton-proton collisions at centre-of-mass energies of sqrt(s) = 900 GeV and 7 TeV collected during 2009 and 2010. Then, using the decay of K_s and Lambda particles, the calorimeter response to specific types of particles (positively and negatively charged pions, protons, and anti-protons) is measured and compared to the Monte Carlo predictions. Finally, the jet energy scale uncertainty is determined by propagating the response uncertainty for single charged and neutral particles to jets. The response uncertainty is 2-5% for central isolated hadrons and 1-3% for the final calorimeter jet energy scale.Comment: 24 pages plus author list (36 pages total), 23 figures, 1 table, submitted to European Physical Journal