Project acronym Amitochondriates
Project Life without mitochondrion
Researcher (PI) Vladimir HAMPL
Host Institution (HI) UNIVERZITA KARLOVA
Call Details Consolidator Grant (CoG), LS8, ERC-2017-COG
Summary Mitochondria are often referred to as the “power houses” of eukaryotic cells. All eukaryotes were thought to have mitochondria of some form until 2016, when the first eukaryote thriving without mitochondria was discovered by our laboratory – a flagellate Monocercomonoides. Understanding cellular functions of these cells, which represent a new functional type of eukaryotes, and understanding the circumstances of the unique event of mitochondrial loss are motivations for this proposal. The first objective focuses on the cell physiology. We will perform a metabolomic study revealing major metabolic pathways and concentrate further on elucidating its unique system of iron-sulphur cluster assembly. In the second objective, we will investigate in details the unique case of mitochondrial loss. We will examine two additional potentially amitochondriate lineages by means of genomics and transcriptomics, conduct experiments simulating the moments of mitochondrial loss and try to induce the mitochondrial loss in vitro by knocking out or down genes for mitochondrial biogenesis. We have chosen Giardia intestinalis and Entamoeba histolytica as models for the latter experiments, because their mitochondria are already reduced to minimalistic “mitosomes” and because some genetic tools are already available for them. Successful mitochondrial knock-outs would enable us to study mitochondrial loss in ‘real time’ and in vivo. In the third objective, we will focus on transforming Monocercomonoides into a tractable laboratory model by developing methods of axenic cultivation and genetic manipulation. This will open new possibilities in the studies of this organism and create a cell culture representing an amitochondriate model for cell biological studies enabling the dissection of mitochondrial effects from those of other compartments. The team is composed of the laboratory of PI and eight invited experts and we hope it has the ability to address these challenging questions.
Summary
Mitochondria are often referred to as the “power houses” of eukaryotic cells. All eukaryotes were thought to have mitochondria of some form until 2016, when the first eukaryote thriving without mitochondria was discovered by our laboratory – a flagellate Monocercomonoides. Understanding cellular functions of these cells, which represent a new functional type of eukaryotes, and understanding the circumstances of the unique event of mitochondrial loss are motivations for this proposal. The first objective focuses on the cell physiology. We will perform a metabolomic study revealing major metabolic pathways and concentrate further on elucidating its unique system of iron-sulphur cluster assembly. In the second objective, we will investigate in details the unique case of mitochondrial loss. We will examine two additional potentially amitochondriate lineages by means of genomics and transcriptomics, conduct experiments simulating the moments of mitochondrial loss and try to induce the mitochondrial loss in vitro by knocking out or down genes for mitochondrial biogenesis. We have chosen Giardia intestinalis and Entamoeba histolytica as models for the latter experiments, because their mitochondria are already reduced to minimalistic “mitosomes” and because some genetic tools are already available for them. Successful mitochondrial knock-outs would enable us to study mitochondrial loss in ‘real time’ and in vivo. In the third objective, we will focus on transforming Monocercomonoides into a tractable laboratory model by developing methods of axenic cultivation and genetic manipulation. This will open new possibilities in the studies of this organism and create a cell culture representing an amitochondriate model for cell biological studies enabling the dissection of mitochondrial effects from those of other compartments. The team is composed of the laboratory of PI and eight invited experts and we hope it has the ability to address these challenging questions.
Max ERC Funding
1 935 500 €
Duration
Start date: 2018-05-01, End date: 2023-04-30
Project acronym BEHAVFRICTIONS
Project Behavioral Implications of Information-Processing Frictions
Researcher (PI) Jakub STEINER
Host Institution (HI) NARODOHOSPODARSKY USTAV AKADEMIE VED CESKE REPUBLIKY VEREJNA VYZKUMNA INSTITUCE
Call Details Consolidator Grant (CoG), SH1, ERC-2017-COG
Summary BEHAVFRICTIONS will use novel models focussing on information-processing frictions to explain choice patterns described in behavioral economics and psychology. The proposed research will provide microfoundations that are essential for (i) identification of stable preferences, (ii) counterfactual predictions, and (iii) normative conclusions.
(i) Agents who face information-processing costs must trade the precision of choice against information costs. Their behavior thus reflects both their stable preferences and the context-dependent procedures that manage their errors stemming from imperfect information processing. In the absence of micro-founded models, the two drivers of the behavior are difficult to disentangle for outside observers. In some pillars of the proposal, the agents follow choice rules that closely resemble logit rules used in structural estimation. This will allow me to reinterpret the structural estimation fits to choice data and to make a distinction between the stable preferences and frictions.
(ii) Such a distinction is important in counterfactual policy analysis because the second-best decision procedures that manage the errors in choice are affected by the analysed policy. Incorporation of the information-processing frictions into existing empirical methods will improve our ability to predict effects of the policies.
(iii) My preliminary results suggest that when an agent is prone to committing errors, biases--such as overconfidence, confirmatory bias, or perception biases known from prospect theory--arise under second-best strategies. By providing the link between the agent's environment and the second-best distribution of the perception errors, my models will delineate environments in which these biases shield the agents from the most costly mistakes from environments in which the biases turn into maladaptations. The distinction will inform the normative debate on debiasing.
Summary
BEHAVFRICTIONS will use novel models focussing on information-processing frictions to explain choice patterns described in behavioral economics and psychology. The proposed research will provide microfoundations that are essential for (i) identification of stable preferences, (ii) counterfactual predictions, and (iii) normative conclusions.
(i) Agents who face information-processing costs must trade the precision of choice against information costs. Their behavior thus reflects both their stable preferences and the context-dependent procedures that manage their errors stemming from imperfect information processing. In the absence of micro-founded models, the two drivers of the behavior are difficult to disentangle for outside observers. In some pillars of the proposal, the agents follow choice rules that closely resemble logit rules used in structural estimation. This will allow me to reinterpret the structural estimation fits to choice data and to make a distinction between the stable preferences and frictions.
(ii) Such a distinction is important in counterfactual policy analysis because the second-best decision procedures that manage the errors in choice are affected by the analysed policy. Incorporation of the information-processing frictions into existing empirical methods will improve our ability to predict effects of the policies.
(iii) My preliminary results suggest that when an agent is prone to committing errors, biases--such as overconfidence, confirmatory bias, or perception biases known from prospect theory--arise under second-best strategies. By providing the link between the agent's environment and the second-best distribution of the perception errors, my models will delineate environments in which these biases shield the agents from the most costly mistakes from environments in which the biases turn into maladaptations. The distinction will inform the normative debate on debiasing.
Max ERC Funding
1 321 488 €
Duration
Start date: 2018-06-01, End date: 2023-05-31
Project acronym CoCoSym
Project Symmetry in Computational Complexity
Researcher (PI) Libor BARTO
Host Institution (HI) UNIVERZITA KARLOVA
Call Details Consolidator Grant (CoG), PE6, ERC-2017-COG
Summary The last 20 years of rapid development in the computational-theoretic aspects of the fixed-language Constraint Satisfaction Problems (CSPs) has been fueled by a connection between the complexity and a certain concept capturing symmetry of computational problems in this class.
My vision is that this connection will eventually evolve into the organizing principle of computational complexity and will lead to solutions of fundamental problems such as the Unique Games Conjecture or even the P-versus-NP problem. In order to break through the current limits of this algebraic approach, I will concentrate on specific goals designed to:
(A) Discover suitable objects capturing symmetry that reflect the complexity in problem classes, where such an object is not known yet;
(B) Make the natural ordering of symmetries coarser so that it reflects the complexity more faithfully;
(C) Delineate the borderline between computationally hard and easy problems;
(D) Strengthen characterizations of existing borderlines to increase their usefulness as tools for proving hardness and designing efficient algorithm; and
(E) Design efficient algorithms based on direct and indirect uses of symmetries.
The specific goals concern the fixed-language CSP over finite relational structures and its generalizations to infinite domains (iCSP) and weighted relations (vCSP), in which the algebraic theory is highly developed and the limitations are clearly visible.
The approach is based on joining the forces of the universal algebraic methods in finite domains, model-theoretical and topological methods in the iCSP, and analytical and probabilistic methods in the vCSP. The starting point is to generalize and improve the Absorption Theory from finite domains.
Summary
The last 20 years of rapid development in the computational-theoretic aspects of the fixed-language Constraint Satisfaction Problems (CSPs) has been fueled by a connection between the complexity and a certain concept capturing symmetry of computational problems in this class.
My vision is that this connection will eventually evolve into the organizing principle of computational complexity and will lead to solutions of fundamental problems such as the Unique Games Conjecture or even the P-versus-NP problem. In order to break through the current limits of this algebraic approach, I will concentrate on specific goals designed to:
(A) Discover suitable objects capturing symmetry that reflect the complexity in problem classes, where such an object is not known yet;
(B) Make the natural ordering of symmetries coarser so that it reflects the complexity more faithfully;
(C) Delineate the borderline between computationally hard and easy problems;
(D) Strengthen characterizations of existing borderlines to increase their usefulness as tools for proving hardness and designing efficient algorithm; and
(E) Design efficient algorithms based on direct and indirect uses of symmetries.
The specific goals concern the fixed-language CSP over finite relational structures and its generalizations to infinite domains (iCSP) and weighted relations (vCSP), in which the algebraic theory is highly developed and the limitations are clearly visible.
The approach is based on joining the forces of the universal algebraic methods in finite domains, model-theoretical and topological methods in the iCSP, and analytical and probabilistic methods in the vCSP. The starting point is to generalize and improve the Absorption Theory from finite domains.
Max ERC Funding
1 211 375 €
Duration
Start date: 2018-02-01, End date: 2023-01-31
