Learning Convex Partitions and Computing Game-theoretic Equilibria from Best Response Queries

Suppose that an $m$-simplex is partitioned into $n$ convex regions having disjoint interiors and distinct labels, and we may learn the label of any point by querying it. The learning objective is to know, for any point in the simplex, a label that occurs within some distance $\epsilon$ from that point. We present two algorithms for this task: Constant-Dimension Generalised Binary Search (CD-GBS), which for constant $m$ uses $poly(n, \log \left( \frac{1}{\epsilon} \right))$ queries, and Constant-Region Generalised Binary Search (CR-GBS), which uses CD-GBS as a subroutine and for constant $n$ uses $poly(m, \log \left( \frac{1}{\epsilon} \right))$ queries. We show via Kakutani's fixed-point theorem that these algorithms provide bounds on the best-response query complexity of computing approximate well-supported equilibria of bimatrix games in which one of the players has a constant number of pure strategies. We also partially extend our results to games with multiple players, establishing further query complexity bounds for computing approximate well-supported equilibria in this setting.Comment: 38 pages, 7 figures, second version strengthens lower bound in Theorem 6, adds footnotes with additional comments and fixes typo

An Empirical Study of Finding Approximate Equilibria in Bimatrix Games

While there have been a number of studies about the efficacy of methods to find exact Nash equilibria in bimatrix games, there has been little empirical work on finding approximate Nash equilibria. Here we provide such a study that compares a number of approximation methods and exact methods. In particular, we explore the trade-off between the quality of approximate equilibrium and the required running time to find one. We found that the existing library GAMUT, which has been the de facto standard that has been used to test exact methods, is insufficient as a test bed for approximation methods since many of its games have pure equilibria or other easy-to-find good approximate equilibria. We extend the breadth and depth of our study by including new interesting families of bimatrix games, and studying bimatrix games upto size $2000 \times 2000$. Finally, we provide new close-to-worst-case examples for the best-performing algorithms for finding approximate Nash equilibria

Simulated Quantum Computation of Global Minima

Finding the optimal solution to a complex optimization problem is of great importance in practically all fields of science, technology, technical design and econometrics. We demonstrate that a modified Grover's quantum algorithm can be applied to real problems of finding a global minimum using modest numbers of quantum bits. Calculations of the global minimum of simple test functions and Lennard-Jones clusters have been carried out on a quantum computer simulator using a modified Grover's algorithm. The number of function evaluations $N$ reduced from O(N) in classical simulation to $O(\sqrt{N})$ in quantum simulation. We also show how the Grover's quantum algorithm can be combined with the classical Pivot method for global optimization to treat larger systems.Comment: 6 figures. Molecular Physics, in pres

Parameterized lower bound and NP-completeness of some HH-free Edge Deletion problems

For a graph $H$, the $H$-free Edge Deletion problem asks whether there exist at most $k$ edges whose deletion from the input graph $G$ results in a graph without any induced copy of $H$. We prove that $H$-free Edge Deletion is NP-complete if $H$ is a graph with at least two edges and $H$ has a component with maximum number of vertices which is a tree or a regular graph. Furthermore, we obtain that these NP-complete problems cannot be solved in parameterized subexponential time, i.e., in time $2^{o(k)}\cdot |G|^{O(1)}$, unless Exponential Time Hypothesis fails.Comment: 15 pages, COCOA 15 accepted pape

Unit Interval Editing is Fixed-Parameter Tractable

Given a graph~$G$ and integers $k_1$, $k_2$, and~$k_3$, the unit interval editing problem asks whether $G$ can be transformed into a unit interval graph by at most $k_1$ vertex deletions, $k_2$ edge deletions, and $k_3$ edge additions. We give an algorithm solving this problem in time $2^{O(k\log k)}\cdot (n+m)$, where $k := k_1 + k_2 + k_3$, and $n, m$ denote respectively the numbers of vertices and edges of $G$. Therefore, it is fixed-parameter tractable parameterized by the total number of allowed operations. Our algorithm implies the fixed-parameter tractability of the unit interval edge deletion problem, for which we also present a more efficient algorithm running in time $O(4^k \cdot (n + m))$. Another result is an $O(6^k \cdot (n + m))$-time algorithm for the unit interval vertex deletion problem, significantly improving the algorithm of van 't Hof and Villanger, which runs in time $O(6^k \cdot n^6)$.Comment: An extended abstract of this paper has appeared in the proceedings of ICALP 2015. Update: The proof of Lemma 4.2 has been completely rewritten; an appendix is provided for a brief overview of related graph classe

The generalised anxiety stigma scale (GASS): psychometric properties in a community sample

<p>Abstract</p> <p>Background</p> <p>Although there is substantial concern about negative attitudes to mental illness, little is known about the stigma associated with Generalised Anxiety Disorder (GAD) or its measurement. The aim of this study was to develop a multi-item measure of Generalised Anxiety Disorder stigma (the GASS).</p> <p>Methods</p> <p>Stigma items were developed from a thematic analysis of web-based text about the stigma associated with GAD. Six hundred and seventeen members of the public completed a survey comprising the resulting 20 stigma items and measures designed to evaluate construct validity. Follow-up data were collected for a subset of the participants (n = 212).</p> <p>Results</p> <p>The factor structure comprised two components: Personal Stigma (views about Generalised Anxiety Disorder); and Perceived Stigma (views about the beliefs of most others in the community). There was evidence of good construct validity and reliability for each of the Generalised Anxiety Stigma Scale (GASS) subscales.</p> <p>Conclusions</p> <p>The GASS is a promising brief measure of the stigma associated with Generalised Anxiety Disorder.</p

Genetic Modulation of Lipid Profiles following Lifestyle Modification or Metformin Treatment: the Diabetes Prevention Program

Weight-loss interventions generally improve lipid profiles and reduce cardiovascular disease risk, but effects are variable and may depend on genetic factors. We performed a genetic association analysis of data from 2,993 participants in the Diabetes Prevention Program to test the hypotheses that a genetic risk score (GRS) based on deleterious alleles at 32 lipid-associated single-nucleotide polymorphisms modifies the effects of lifestyle and/or metformin interventions on lipid levels and nuclear magnetic resonance (NMR) lipoprotein subfraction size and number. Twenty-three loci previously associated with fasting LDL-C, HDL-C, or triglycerides replicated (P=0.04–1×10$^{−17}$). Except for total HDL particles (r=−0.03, P=0.26), all components of the lipid profile correlated with the GRS (partial |r|=0.07–0.17, P=5×10$^{−5}$–1×10$^{−19}$). The GRS was associated with higher baseline-adjusted 1-year LDL cholesterol levels (β=+0.87, SEE±0.22 mg/dl/allele, P=8×10−5, P$_{interaction}$=0.02) in the lifestyle intervention group, but not in the placebo (β=+0.20, SEE±0.22 mg/dl/allele, P=0.35) or metformin (β=−0.03, SEE±0.22 mg/dl/allele, P=0.90; P$_{interaction}$=0.64) groups. Similarly, a higher GRS predicted a greater number of baseline-adjusted small LDL particles at 1 year in the lifestyle intervention arm (β=+0.30, SEE±0.012 ln nmol/L/allele, P=0.01, P$_{interaction}$=0.01) but not in the placebo (β=−0.002, SEE±0.008 ln nmol/L/allele, P=0.74) or metformin (β=+0.013, SEE±0.008 nmol/L/allele, P=0.12; P$_{interaction}$ = 0.24) groups. Our findings suggest that a high genetic burden confers an adverse lipid profile and predicts attenuated response in LDL-C levels and small LDL particle number to dietary and physical activity interventions aimed at weight loss

Protocol for the saMS trial (supportive adjustment for multiple sclerosis): a randomized controlled trial comparing cognitive behavioral therapy to supportive listening for adjustment to multiple sclerosis

BackgroundMultiple Sclerosis (MS) is an incurable, chronic, potentially progressive and unpredictable disease of the central nervous system. The disease produces a range of unpleasant and debilitating symptoms, which can have a profound impact including disrupting activities of daily living, employment, income, relationships, social and leisure activities, and life goals. Adjusting to the illness is therefore particularly challenging. This trial tests the effectiveness of a cognitive behavioural intervention compared to supportive listening to assist adjustment in the early stages of MS.MethodsThis is a two arm randomized multi-centre parallel group controlled trial. 122 consenting participants who meet eligibility criteria will be randomly allocated to receive either Cognitive Behavioral Therapy or Supportive Listening. Eight one hour sessions of therapy (delivered over a period of 10 weeks) will be delivered by general nurses trained in both treatments. Self-report questionnaire data will be collected at baseline (0 weeks), mid-therapy (week 5 of therapy), post-therapy (15 weeks) and at six months (26 weeks) and twelve months (52 weeks) follow-up. Primary outcomes are distress and MS-related social and role impairment at twelve month follow-up. Analysis will also consider predictors and mechanisms of change during therapy. In-depth interviews to examine participants’ experiences of the interventions will be conducted with a purposively sampled sub-set of the trial participants. An economic analysis will also take place. DiscussionThis trial is distinctive in its aims in that it aids adjustment to MS in a broad sense. It is not a treatment specifically for depression. Use of nurses as therapists makes the interventions potentially viable in terms of being rolled out in the NHS. The trial benefits from incorporating patient input in the development and evaluation stages. The trial will provide important information about the efficacy, cost-effectiveness and acceptability of the interventions as well as mechanisms of psychosocial adjustment.Trial registrationCurrent Controlled Trials ISRCTN91377356<br/

Light dark matter and Z′Z' dark force at colliders

Light Dark Matter, $<10$ GeV, with sizable direct detection rate is an interesting and less explored scenario. Collider searches can be very powerful, such as through the channel in which a pair of dark matter particle are produced in association with a jet. It is a generic possibility that the mediator of the interaction between DM and the nucleus will also be accessible at the Tevatron and the LHC. Therefore, collider search of the mediator can provide a more comprehensive probe of the dark matter and its interactions. In this article, to demonstrate the complementarity of these two approaches, we focus on the possibility of the mediator being a new $U(1)'$ gauge boson, which is probably the simplest model which allows a large direct detection cross section for a light dark matter candidate. We combine searches in the monojet+MET channel and dijet resonance search for the mediator. We find that for the mass of $Z'$ between 250 GeV and 4 TeV, resonance searches at the colliders provide stronger constraints on this model than the monojet+MET searches.Comment: 23 pages and 14 figure