The Complexity of Admissibility in Omega-Regular Games

Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games played on graphs with omega-regular objectives. In this paper, we study the algorithmic properties of this concept for such games. We settle the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies. As a byproduct of our construction, we obtain automata which recognize all the possible outcomes of such strategies

Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets

In the context of strategic games, we provide an axiomatic proof of the statement Common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. Rationality here means playing only strategies one believes to be best responses. This involves looking at two formal languages. One is first-order, and is used to formalise optimality conditions, like avoiding strictly dominated strategies, or playing a best response. The other is a modal fixpoint language with expressions for optimality, rationality and belief. Fixpoints are used to form expressions for common belief and for iterated elimination of non-optimal strategies.Comment: 16 pages, Proc. 11th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XI). To appea

Fixed-Parameter Tractable Distances to Sparse Graph Classes

We show that for various classes $\mathcal{C}$ of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph $\small{G}$ to $\mathcal{C}$ is fixed-parameter tractable. The results are based on two general techniques. The first of these, building on recent work of Grohe et al. establishes that any class of graphs that is slicewise nowhere dense and slicewise first-order definable is FPT. The second shows that determining the elimination distance of a graph $\small{G}$ to a minor-closed class $\mathcal{C}$ is FPT. We demonstrate that several prior results (of Golovach, Moser and Thilikos and Mathieson) on the fixed-parameter tractability of distance measures are special cases of our first method

Impaired haematopoietic stem cell differentiation and enhanced skewing towards myeloid progenitors in aged caspase-2-deficient mice

The apoptotic cysteine protease caspase-2 has been shown to suppress tumourigenesis in mice and its reduced expression correlates with poor prognosis in some human malignancies. Caspase-2-deficient mice develop normally but show ageing-related traits and, when challenged by oncogenic stimuli or certain stress, show enhanced tumour development, often accompanied by extensive aneuploidy. As stem cells are susceptible to acquiring age-related functional defects because of their self-renewal and proliferative capacity, we examined whether loss of caspase-2 promotes such defects with age. Using young and aged Casp2−/− mice, we demonstrate that deficiency of caspase-2 results in enhanced aneuploidy and DNA damage in bone marrow (BM) cells with ageing. Furthermore, we demonstrate for the first time that caspase-2 loss results in significant increase in immunophenotypically defined short-term haematopoietic stem cells (HSCs) and multipotent progenitors fractions in BM with a skewed differentiation towards myeloid progenitors with ageing. Caspase-2 deficiency leads to enhanced granulocyte macrophage and erythroid progenitors in aged mice. Colony-forming assays and long-term culture-initiating assay further recapitulated these results. Our results provide the first evidence of caspase-2 in regulating HSC and progenitor differentiation, as well as aneuploidy, in vivo.Swati Dawar, Nur Hezrin Shahrin, Nikolina Sladojevic, Richard J D, Andrea, Loretta Dorstyn, Devendra K Hiwase and Sharad Kuma

Compact Labelings For Efficient First-Order Model-Checking

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is \emph{nicely locally cwd-decomposable}. This notion generalizes that of a \emph{nicely locally tree-decomposable} class. The graphs of such classes can be covered by graphs of bounded \emph{clique-width} with limited overlaps. We also consider such labelings for \emph{bounded} first-order formulas on graph classes of \emph{bounded expansion}. Some of these results are extended to counting queries

Randomisation and Derandomisation in Descriptive Complexity Theory

We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BPP, bounded error probabilistic polynomial time, is defined from PTIME. Our main focus lies on questions of derandomisation, and we prove that there is a query which is definable in BPFO, the probabilistic version of first-order logic, but not in Cinf, finite variable infinitary logic with counting. This implies that many of the standard logics of finite model theory, like transitive closure logic and fixed-point logic, both with and without counting, cannot be derandomised. Similarly, we present a query on ordered structures which is definable in BPFO but not in monadic second-order logic, and a query on additive structures which is definable in BPFO but not in FO. The latter of these queries shows that certain uniform variants of AC0 (bounded-depth polynomial sized circuits) cannot be derandomised. These results are in contrast to the general belief that most standard complexity classes can be derandomised. Finally, we note that BPIFP+C, the probabilistic version of fixed-point logic with counting, captures the complexity class BPP, even on unordered structures

On Second-Order Monadic Monoidal and Groupoidal Quantifiers

We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a computational classification of the expressive power of these logics over strings with varying built-in predicates. In particular, we show that ATIME(n) can be logically characterized in terms of second-order monadic monoidal quantifiers

Quality of Life Assessment in Multiple Myeloma Patients Undergoing Dose-Reduced Tandem Autologous Stem Cell Transplantation

Few studies exist that consider health-related quality of life (HR-QoL) in patients with multiple myeloma (MM) undergoing tandem autologous stem cell transplantation (TASCT). Eighteen patients with advanced MM who underwent dose-modified TASCT were enrolled in this study between March 2006 and March 2008. Patients <60 year old (10) received conditioning with melphalan 140 mg/m2 and patients who were ≥60 years (8) received 100 mg/m2. The median age was 57.5 years (range 35–69). We conducted the European Organization of Research and Treatment of Cancer (EORTC) QLQ-C30 and the QLQ-MY24 questionnaires via interviews at presentation, after each ASCT and thereafter every 3 months for 24 months. Mean global health measure improved from 3.44 before transplant to 4.50 (1=very poor, 7=excellent) at the second and subsequent follow-up visits (P<0.001) and the mean global quality of life score improved from 3.61 to 4.71 (P<0.001). Pain symptoms were reduced (P=0.001), and physical functioning improved (P<0.001) throughout the period of post-transplant follow-up. Our study showed that dose-reduced TASCT is well tolerated with low toxicity albeit the transient reduction in QoL during both transplants. Post-transplant follow-up showed significant improvement in overall HR-QoL that reflects positively on the overall disease-outcome. Furthermore, a sole focus on patient-survival does not adequately provide indication regarding the tolerability and effectiveness of a proposed treatment on the patient’s perceived quality of life. As clinicians, our primary concern should be toward patient-welfare as well as survival. Therefore, we should employ the tools of QoL in conjunction with overall survival in order to deliver the best possible patient outcomes. The EORTC-QLQ-MY24 is a practical tool in measuring QoL in myeloma patients

Caspase-2-mediated cell death is required for deleting aneuploid cells

Caspase-2, one of the most evolutionarily conserved of the caspase family, has been implicated in maintenance of chromosomal stability and tumour suppression. Caspase-2 deficient (Casp2-/-) mice develop normally but show premature ageing-related traits and when challenged by certain stressors, succumb to enhanced tumour development and aneuploidy. To test how caspase-2 protects against chromosomal instability, we utilized an ex vivo system for aneuploidy where primary splenocytes from Casp2-/- mice were exposed to anti-mitotic drugs and followed up by live cell imaging. Our data show that caspase-2 is required for deleting mitotically aberrant cells. Acute silencing of caspase-2 in cultured human cells recapitulated these results. We further generated Casp2C320S mutant mice to demonstrate that caspase-2 catalytic activity is essential for its function in limiting aneuploidy. Our results provide direct evidence that the apoptotic activity of caspase-2 is necessary for deleting cells with mitotic aberrations to limit aneuploidy.S Dawar, Y Lim, J Puccini, M White, P Thomas, L Bouchier-Hayes, D R Green, L Dorstyn and S Kuma

The GALNT9, BNC1 and CCDC8 genes are frequently epigenetically dysregulated in breast tumours that metastasise to the brain.

Tumour metastasis to the brain is a common and deadly development in certain cancers; 18-30 % of breast tumours metastasise to the brain. The contribution that gene silencing through epigenetic mechanisms plays in these metastatic tumours is not well understood