28,232 research outputs found

    Dynamics of growth factor production in monolayers of cancer cells and evolution of resistance to anticancer therapies

    Get PDF
    Tumor heterogeneity is well documented for many characters, including the production of growth factors, which improve tumor proliferation and promote resistance against apoptosis and against immune reaction. What maintains heterogeneity remains an open question that has implications for diagnosis and treatment. While it has been suggested that therapies targeting growth factors are robust against evolved resistance, current therapies against growth factors, like antiangiogenic drugs, are not effective in the long term, as resistant mutants can evolve and lead to relapse. We use evolutionary game theory to study the dynamics of the production of growth factors by monolayers of cancer cells and to understand the effect of therapies that target growth factors. The dynamics depend on the production cost of the growth factor, on its diffusion range and on the type of benefit it confers to the cells. Stable heterogeneity is a typical outcome of the dynamics, while a pure equilibrium of nonproducer cells is possible under certain conditions. Such pure equilibrium can be the goal of new anticancer therapies. We show that current therapies, instead, can be effective only if growth factors are almost completely eliminated and if the reduction is almost immediate

    Non-Zero Sum Games for Reactive Synthesis

    Get PDF
    In this invited contribution, we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution concepts are developed in the context of non-zero sum games played on graphs. They are part of the contributions obtained in the inVEST project funded by the European Research Council.Comment: LATA'16 invited pape

    Computer aided synthesis: a game theoretic approach

    Full text link
    In this invited contribution, we propose a comprehensive introduction to game theory applied in computer aided synthesis. In this context, we give some classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illustrative examples as well as intuitions on the proofs.Comment: Invitation contribution for conference "Developments in Language Theory" (DLT 2017

    Utility, games, and narratives

    Get PDF
    This paper provides a general overview of theories and tools to model individual and collective decision-making. In particular, stress is laid on the interaction of several decision-makers. A substantial part of this paper is devoted to utility maximization and its application to collective decision-making, Game Theory. However, the pitfalls of utility maximization are thoroughly discussed, and the radically alternative approach of viewing decision-making as constructing narratives is presented with its emerging computational tools.Interactions, Collective Decision-Making

    The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

    Get PDF
    We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fall into a certain interval may lead to undecidability. In particular, we prove that the following problem is undecidable: Given a game G, does there exist a pure-strategy Nash equilibrium of G where player 0 wins with probability 1. Moreover, this problem remains undecidable if it is restricted to strategies with (unbounded) finite memory. However, if mixed strategies are allowed, decidability remains an open problem. One way to obtain a provably decidable variant of the problem is restricting the strategies to be positional or stationary. For the complexity of these two problems, we obtain a common lower bound of NP and upper bounds of NP and PSPACE respectively.Comment: 23 pages; revised versio

    Family Control and the Rent-Seeking Society

    Full text link
    The small number of very large family-controlled corporate groups in many countries combined with their long continuity of control and ability to act discretely give these organizations a comparative advantage in political rent-seeking. This advantage is a key part of a self-reinforcing system whereby oligarchic family corporate control, political rent seeking, and low general levels of trust combine to stymie growth.http://deepblue.lib.umich.edu/bitstream/2027.42/39971/3/wp585.pd

    Equilibria-based Probabilistic Model Checking for Concurrent Stochastic Games

    Get PDF
    Probabilistic model checking for stochastic games enables formal verification of systems that comprise competing or collaborating entities operating in a stochastic environment. Despite good progress in the area, existing approaches focus on zero-sum goals and cannot reason about scenarios where entities are endowed with different objectives. In this paper, we propose probabilistic model checking techniques for concurrent stochastic games based on Nash equilibria. We extend the temporal logic rPATL (probabilistic alternating-time temporal logic with rewards) to allow reasoning about players with distinct quantitative goals, which capture either the probability of an event occurring or a reward measure. We present algorithms to synthesise strategies that are subgame perfect social welfare optimal Nash equilibria, i.e., where there is no incentive for any players to unilaterally change their strategy in any state of the game, whilst the combined probabilities or rewards are maximised. We implement our techniques in the PRISM-games tool and apply them to several case studies, including network protocols and robot navigation, showing the benefits compared to existing approaches
    • …
    corecore