@article{1819,
  abstract     = {The sessile life style of plants creates the need to deal with an often adverse environment, in which water availability can change on a daily basis, challenging the cellular physiology and integrity. Changes in osmotic conditions disrupt the equilibrium of the plasma membrane: hypoosmotic conditions increase and hyperosmotic environment decrease the cell volume. Here, we show that short-term extracellular osmotic treatments are closely followed by a shift in the balance between endocytosis and exocytosis in root meristem cells. Acute hyperosmotic treatments (ionic and nonionic) enhance clathrin-mediated endocytosis simultaneously attenuating exocytosis, whereas hypoosmotic treatments have the opposite effects. In addition to clathrin recruitment to the plasma membrane, components of early endocytic trafficking are essential during hyperosmotic stress responses. Consequently, growth of seedlings defective in elements of clathrin or early endocytic machinery is more sensitive to hyperosmotic treatments. We also found that the endocytotic response to a change of osmotic status in the environment is dominant over the presumably evolutionary more recent regulatory effect of plant hormones, such as auxin. These results imply that osmotic perturbation influences the balance between endocytosis and exocytosis acting through clathrin-mediated endocytosis. We propose that tension on the plasma membrane determines the addition or removal of membranes at the cell surface, thus preserving cell integrity.},
  author       = {Zwiewka, Marta and Nodzyński, Tomasz and Robert, Stéphanie and Vanneste, Steffen and Friml, Jiřĺ},
  journal      = {Molecular Plant},
  number       = {8},
  pages        = {1175 -- 1187},
  publisher    = {Elsevier},
  title        = {{Osmotic stress modulates the balance between exocytosis and clathrin mediated endocytosis in Arabidopsis thaliana}},
  doi          = {10.1016/j.molp.2015.03.007},
  volume       = {8},
  year         = {2015},
}

@article{1823,
  abstract     = {Abstract Drug combinations are increasingly important in disease treatments, for combating drug resistance, and for elucidating fundamental relationships in cell physiology. When drugs are combined, their individual effects on cells may be amplified or weakened. Such drug interactions are crucial for treatment efficacy, but their underlying mechanisms remain largely unknown. To uncover the causes of drug interactions, we developed a systematic approach based on precise quantification of the individual and joint effects of antibiotics on growth of genome-wide Escherichia coli gene deletion strains. We found that drug interactions between antibiotics representing the main modes of action are highly robust to genetic perturbation. This robustness is encapsulated in a general principle of bacterial growth, which enables the quantitative prediction of mutant growth rates under drug combinations. Rare violations of this principle exposed recurring cellular functions controlling drug interactions. In particular, we found that polysaccharide and ATP synthesis control multiple drug interactions with previously unexplained mechanisms, and small molecule adjuvants targeting these functions synthetically reshape drug interactions in predictable ways. These results provide a new conceptual framework for the design of multidrug combinations and suggest that there are universal mechanisms at the heart of most drug interactions. Synopsis A general principle of bacterial growth enables the prediction of mutant growth rates under drug combinations. Rare violations of this principle expose cellular functions that control drug interactions and can be targeted by small molecules to alter drug interactions in predictable ways. Drug interactions between antibiotics are highly robust to genetic perturbations. A general principle of bacterial growth enables the prediction of mutant growth rates under drug combinations. Rare violations of this principle expose cellular functions that control drug interactions. Diverse drug interactions are controlled by recurring cellular functions, including LPS synthesis and ATP synthesis. A general principle of bacterial growth enables the prediction of mutant growth rates under drug combinations. Rare violations of this principle expose cellular functions that control drug interactions and can be targeted by small molecules to alter drug interactions in predictable ways.},
  author       = {Chevereau, Guillaume and Bollenbach, Mark Tobias},
  journal      = {Molecular Systems Biology},
  number       = {4},
  publisher    = {Nature Publishing Group},
  title        = {{Systematic discovery of drug interaction mechanisms}},
  doi          = {10.15252/msb.20156098},
  volume       = {11},
  year         = {2015},
}

@article{1824,
  abstract     = {Condensation phenomena arise through a collective behaviour of particles. They are observed in both classical and quantum systems, ranging from the formation of traffic jams in mass transport models to the macroscopic occupation of the energetic ground state in ultra-cold bosonic gases (Bose-Einstein condensation). Recently, it has been shown that a driven and dissipative system of bosons may form multiple condensates. Which states become the condensates has, however, remained elusive thus far. The dynamics of this condensation are described by coupled birth-death processes, which also occur in evolutionary game theory. Here we apply concepts from evolutionary game theory to explain the formation of multiple condensates in such driven-dissipative bosonic systems. We show that the vanishing of relative entropy production determines their selection. The condensation proceeds exponentially fast, but the system never comes to rest. Instead, the occupation numbers of condensates may oscillate, as we demonstrate for a rock-paper-scissors game of condensates.},
  author       = {Knebel, Johannes and Weber, Markus and Krüger, Torben H and Frey, Erwin},
  journal      = {Nature Communications},
  publisher    = {Nature Publishing Group},
  title        = {{Evolutionary games of condensates in coupled birth-death processes}},
  doi          = {10.1038/ncomms7977},
  volume       = {6},
  year         = {2015},
}

@article{1827,
  abstract     = {Bow-tie or hourglass structure is a common architectural feature found in many biological systems. A bow-tie in a multi-layered structure occurs when intermediate layers have much fewer components than the input and output layers. Examples include metabolism where a handful of building blocks mediate between multiple input nutrients and multiple output biomass components, and signaling networks where information from numerous receptor types passes through a small set of signaling pathways to regulate multiple output genes. Little is known, however, about how bow-tie architectures evolve. Here, we address the evolution of bow-tie architectures using simulations of multi-layered systems evolving to fulfill a given input-output goal. We find that bow-ties spontaneously evolve when the information in the evolutionary goal can be compressed. Mathematically speaking, bow-ties evolve when the rank of the input-output matrix describing the evolutionary goal is deficient. The maximal compression possible (the rank of the goal) determines the size of the narrowest part of the network—that is the bow-tie. A further requirement is that a process is active to reduce the number of links in the network, such as product-rule mutations, otherwise a non-bow-tie solution is found in the evolutionary simulations. This offers a mechanism to understand a common architectural principle of biological systems, and a way to quantitate the effective rank of the goals under which they evolved.},
  author       = {Friedlander, Tamar and Mayo, Avraham and Tlusty, Tsvi and Alon, Uri},
  journal      = {PLoS Computational Biology},
  number       = {3},
  publisher    = {Public Library of Science},
  title        = {{Evolution of bow-tie architectures in biology}},
  doi          = {10.1371/journal.pcbi.1004055},
  volume       = {11},
  year         = {2015},
}

@article{1828,
  abstract     = {We construct a non-linear Markov process connected with a biological model of a bacterial genome recombination. The description of invariant measures of this process gives us the solution of one problem in elementary probability theory.},
  author       = {Akopyan, Arseniy and Pirogov, Sergey and Rybko, Aleksandr},
  journal      = {Journal of Statistical Physics},
  number       = {1},
  pages        = {163 -- 167},
  publisher    = {Springer},
  title        = {{Invariant measures of genetic recombination process}},
  doi          = {10.1007/s10955-015-1238-5},
  volume       = {160},
  year         = {2015},
}

@article{1831,
  abstract     = {This paper introduces a theme issue presenting the latest developments in research on the impacts of sociality on health and fitness. The articles that follow cover research on societies ranging from insects to humans. Variation in measures of fitness (i.e. survival and reproduction) has been linked to various aspects of sociality in humans and animals alike, and variability in individual health and condition has been recognized as a key mediator of these relationships. Viewed from a broad evolutionary perspective, the evolutionary transitions from a solitary lifestyle to group living have resulted in several new health-related costs and benefits of sociality. Social transmission of parasites within groups represents a major cost of group living, but some behavioural mechanisms, such as grooming, have evolved repeatedly to reduce this cost. Group living also has created novel costs in terms of altered susceptibility to infectious and non-infectious disease as a result of the unavoidable physiological consequences of social competition and integration, which are partly alleviated by social buffering in some vertebrates. Here, we define the relevant aspects of sociality, summarize their health-related costs and benefits, and discuss possible fitness measures in different study systems. Given the pervasive effects of social factors on health and fitness, we propose a synthesis of existing conceptual approaches in disease ecology, ecological immunology and behavioural neurosciences by adding sociality as a key factor, with the goal to generate a broader framework for organismal integration of health-related research.},
  author       = {Kappeler, Peter and Cremer, Sylvia and Nunn, Charles},
  journal      = {Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences},
  number       = {1669},
  publisher    = {Royal Society},
  title        = {{Sociality and health: Impacts of sociality on disease susceptibility and transmission in animal and human societies}},
  doi          = {10.1098/rstb.2014.0116},
  volume       = {370},
  year         = {2015},
}

@article{1834,
  abstract     = {Huge body of evidences demonstrated that volatile anesthetics affect the hippocampal neurogenesis and neurocognitive functions, and most of them showed impairment at anesthetic dose. Here, we investigated the effect of low dose (1.8%) sevoflurane on hippocampal neurogenesis and dentate gyrus-dependent learning. Neonatal rats at postnatal day 4 to 6 (P4-6) were treated with 1.8% sevoflurane for 6 hours. Neurogenesis was quantified by bromodeoxyuridine labeling and electrophysiology recording. Four and seven weeks after treatment, the Morris water maze and contextual-fear discrimination learning tests were performed to determine the influence on spatial learning and pattern separation. A 6-hour treatment with 1.8% sevoflurane promoted hippocampal neurogenesis and increased the survival of newborn cells and the proportion of immature granular cells in the dentate gyrus of neonatal rats. Sevoflurane-treated rats performed better during the training days of the Morris water maze test and in contextual-fear discrimination learning test. These results suggest that a subanesthetic dose of sevoflurane promotes hippocampal neurogenesis in neonatal rats and facilitates their performance in dentate gyrus-dependent learning tasks.},
  author       = {Chen, Chong and Wang, Chao and Zhao, Xuan and Zhou, Tao and Xu, Dao and Wang, Zhi and Wang, Ying},
  journal      = {ASN Neuro},
  number       = {2},
  publisher    = {SAGE Publications},
  title        = {{Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats}},
  doi          = {10.1177/1759091415575845},
  volume       = {7},
  year         = {2015},
}

@inproceedings{1835,
  abstract     = {The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs –an important problem of interest in evolutionary biology– more efficiently than the classical simulation method. We specify the property in linear temporal logics. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights.},
  author       = {Giacobbe, Mirco and Guet, Calin C and Gupta, Ashutosh and Henzinger, Thomas A and Paixao, Tiago and Petrov, Tatjana},
  location     = {London, United Kingdom},
  pages        = {469 -- 483},
  publisher    = {Springer},
  title        = {{Model checking gene regulatory networks}},
  doi          = {10.1007/978-3-662-46681-0_47},
  volume       = {9035},
  year         = {2015},
}

@inproceedings{1836,
  abstract     = {In the standard framework for worst-case execution time (WCET) analysis of programs, the main data structure is a single instance of integer linear programming (ILP) that represents the whole program. The instance of this NP-hard problem must be solved to find an estimate forWCET, and it must be refined if the estimate is not tight.We propose a new framework for WCET analysis, based on abstract segment trees (ASTs) as the main data structure. The ASTs have two advantages. First, they allow computing WCET by solving a number of independent small ILP instances. Second, ASTs store more expressive constraints, thus enabling a more efficient and precise refinement procedure. In order to realize our framework algorithmically, we develop an algorithm for WCET estimation on ASTs, and we develop an interpolation-based counterexample-guided refinement scheme for ASTs. Furthermore, we extend our framework to obtain parametric estimates of WCET. We experimentally evaluate our approach on a set of examples from WCET benchmark suites and linear-algebra packages. We show that our analysis, with comparable effort, provides WCET estimates that in many cases significantly improve those computed by existing tools.},
  author       = {Cerny, Pavol and Henzinger, Thomas A and Kovács, Laura and Radhakrishna, Arjun and Zwirchmayr, Jakob},
  location     = {London, United Kingdom},
  pages        = {105 -- 131},
  publisher    = {Springer},
  title        = {{Segment abstraction for worst-case execution time analysis}},
  doi          = {10.1007/978-3-662-46669-8_5},
  volume       = {9032},
  year         = {2015},
}

@article{1837,
  abstract     = {Transition to turbulence in straight pipes occurs in spite of the linear stability of the laminar Hagen-Poiseuille flow if both the amplitude of flow perturbations and the Reynolds number Re exceed a minimum threshold (subcritical transition). As the pipe curvature increases, centrifugal effects become important, modifying the basic flow as well as the most unstable linear modes. If the curvature (tube-to-coiling diameter d/D) is sufficiently large, a Hopf bifurcation (supercritical instability) is encountered before turbulence can be excited (subcritical instability). We trace the instability thresholds in the Re - d/D parameter space in the range 0.01 ≤ d/D\ ≤ 0.1 by means of laser-Doppler velocimetry and determine the point where the subcritical and supercritical instabilities meet. Two different experimental set-ups are used: a closed system where the pipe forms an axisymmetric torus and an open system employing a helical pipe. Implications for the measurement of friction factors in curved pipes are discussed.},
  author       = {Kühnen, Jakob and Braunshier, P and Schwegel, M and Kuhlmann, Hendrik and Hof, Björn},
  journal      = {Journal of Fluid Mechanics},
  number       = {5},
  publisher    = {Cambridge University Press},
  title        = {{Subcritical versus supercritical transition to turbulence in curved pipes}},
  doi          = {10.1017/jfm.2015.184},
  volume       = {770},
  year         = {2015},
}

@inproceedings{1838,
  abstract     = {Synthesis of program parts is particularly useful for concurrent systems. However, most approaches do not support common design tasks, like modifying a single process without having to re-synthesize or verify the whole system. Assume-guarantee synthesis (AGS) provides robustness against modifications of system parts, but thus far has been limited to the perfect information setting. This means that local variables cannot be hidden from other processes, which renders synthesis results cumbersome or even impossible to realize.We resolve this shortcoming by defining AGS under partial information. We analyze the complexity and decidability in different settings, showing that the problem has a high worstcase complexity and is undecidable in many interesting cases. Based on these observations, we present a pragmatic algorithm based on bounded synthesis, and demonstrate its practical applicability on several examples.},
  author       = {Bloem, Roderick and Chatterjee, Krishnendu and Jacobs, Swen and Könighofer, Robert},
  location     = {London, United Kingdom},
  pages        = {517 -- 532},
  publisher    = {Springer},
  title        = {{Assume-guarantee synthesis for concurrent reactive programs with partial information}},
  doi          = {10.1007/978-3-662-46681-0_50},
  volume       = {9035},
  year         = {2015},
}

@inproceedings{1839,
  abstract     = {We present MultiGain, a tool to synthesize strategies for Markov decision processes (MDPs) with multiple mean-payoff objectives. Our models are described in PRISM, and our tool uses the existing interface and simulator of PRISM. Our tool extends PRISM by adding novel algorithms for multiple mean-payoff objectives, and also provides features such as (i) generating strategies and exploring them for simulation, and checking them with respect to other properties; and (ii) generating an approximate Pareto curve for two mean-payoff objectives. In addition, we present a new practical algorithm for the analysis of MDPs with multiple mean-payoff objectives under memoryless strategies.},
  author       = {Brázdil, Tomáš and Chatterjee, Krishnendu and Forejt, Vojtěch and Kučera, Antonín},
  location     = {London, United Kingdom},
  pages        = {181 -- 187},
  publisher    = {Springer},
  title        = {{Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives}},
  doi          = {10.1007/978-3-662-46681-0_12},
  volume       = {9035},
  year         = {2015},
}

@article{1840,
  abstract     = {In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approach deals with the latter problem by minimizing an upper bound on the reduction cost instead of minimizing the exact cost. The proposed upper bound is easy to compute and it is tight if the original chain is lumpable with respect to the partition. Then, we express the problem in the form of information bottleneck optimization, and propose using the agglomerative information bottleneck algorithm for searching a suboptimal partition greedily, rather than exhaustively. The theory is illustrated with examples and one application scenario in the context of modeling bio-molecular interactions.},
  author       = {Geiger, Bernhard and Petrov, Tatjana and Kubin, Gernot and Koeppl, Heinz},
  issn         = {0018-9286},
  journal      = {IEEE Transactions on Automatic Control},
  number       = {4},
  pages        = {1010 -- 1022},
  publisher    = {IEEE},
  title        = {{Optimal Kullback-Leibler aggregation via information bottleneck}},
  doi          = {10.1109/TAC.2014.2364971},
  volume       = {60},
  year         = {2015},
}

@article{1841,
  abstract     = {We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diffusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. The new family of algorithms can be viewed as a generalization of TRW-S from pairwise to higher-order graphical models. We test SRMP on several real-world problems with promising results.},
  author       = {Kolmogorov, Vladimir},
  journal      = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  number       = {5},
  pages        = {919 -- 930},
  publisher    = {IEEE},
  title        = {{A new look at reweighted message passing}},
  doi          = {10.1109/TPAMI.2014.2363465},
  volume       = {37},
  year         = {2015},
}

@article{1508,
  abstract     = {We consider generalized Wigner ensembles and general β-ensembles with analytic potentials for any β ≥ 1. The recent universality results in particular assert that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum are universal in the sense that they coincide with those of the corresponding Gaussian β-ensembles. In this article, we show that local averaging is not necessary for this result, i.e. we prove that the single gap distributions in the bulk are universal. In fact, with an additional step, our result can be extended to any C4(ℝ) potential.},
  author       = {Erdös, László and Yau, Horng},
  journal      = {Journal of the European Mathematical Society},
  number       = {8},
  pages        = {1927 -- 2036},
  publisher    = {EMS Press},
  title        = {{Gap universality of generalized Wigner and β ensembles}},
  doi          = {10.4171/JEMS/548},
  volume       = {17},
  year         = {2015},
}

@article{1832,
  abstract     = {Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. },
  author       = {Chakraborty, Soham and Henzinger, Thomas A and Sezgin, Ali and Vafeiadis, Viktor},
  journal      = {Logical Methods in Computer Science},
  number       = {1},
  publisher    = {International Federation for Computational Logic},
  title        = {{Aspect-oriented linearizability proofs}},
  doi          = {10.2168/LMCS-11(1:20)2015},
  volume       = {11},
  year         = {2015},
}

@inproceedings{1610,
  abstract     = {The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1,L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to pushdown automata is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k.},
  author       = {Chatterjee, Krishnendu and Henzinger, Thomas A and Ibsen-Jensen, Rasmus and Otop, Jan},
  booktitle    = {42nd International Colloquium on Automata, Languages, and Programming},
  isbn         = {978-3-662-47665-9},
  location     = {Kyoto, Japan},
  number       = {Part II},
  pages        = {121 -- 133},
  publisher    = {Springer Nature},
  title        = {{Edit distance for pushdown automata}},
  doi          = {10.1007/978-3-662-47666-6_10},
  volume       = {9135},
  year         = {2015},
}

@inproceedings{1657,
  abstract     = {We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. },
  author       = {Chatterjee, Krishnendu and Komárková, Zuzana and Kretinsky, Jan},
  location     = {Kyoto, Japan},
  pages        = {244 -- 256},
  publisher    = {IEEE},
  title        = {{Unifying two views on multiple mean-payoff objectives in Markov decision processes}},
  doi          = {10.1109/LICS.2015.32},
  year         = {2015},
}

@misc{5435,
  abstract     = {We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. 
There have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  
We consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).
Our main results are algorithms for the decision problem which are always polynomial in the size of the MDP.
We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.},
  author       = {Chatterjee, Krishnendu and Komarkova, Zuzana and Kretinsky, Jan},
  issn         = {2664-1690},
  pages        = {51},
  publisher    = {IST Austria},
  title        = {{Unifying two views on multiple mean-payoff objectives in Markov decision processes}},
  doi          = {10.15479/AT:IST-2015-318-v2-1},
  year         = {2015},
}

@misc{5429,
  abstract     = {We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. 
There have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  
We consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.
Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).
Our main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.
Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.},
  author       = {Chatterjee, Krishnendu and Komarkova, Zuzana and Kretinsky, Jan},
  issn         = {2664-1690},
  pages        = {41},
  publisher    = {IST Austria},
  title        = {{Unifying two views on multiple mean-payoff objectives in Markov decision processes}},
  doi          = {10.15479/AT:IST-2015-318-v1-1},
  year         = {2015},
}