scispace - formally typeset
Open AccessBook ChapterDOI

Rewriting game theory as a foundation for state-based models of gene regulation

TLDR
A game-theoretic foundation for gene regulatory analysis based on the recent formalism of rewriting game theory is presented and it is shown that their models are specific instances of a C/P game deduced from the K parameter.
Abstract
We present a game-theoretic foundation for gene regulatory analysis based on the recent formalism of rewriting game theory. Rewriting game theory is discrete and comes with a graph-based framework for understanding compromises and interactions between players and for computing Nash equilibria. The formalism explicitly represents the dynamics of its Nash equilibria and, therefore, is a suitable foundation for the study of steady states in discrete modelling. We apply the formalism to the discrete analysis of gene regulatory networks introduced by R. Thomas and S. Kauffman. Specifically, we show that their models are specific instances of a C/P game deduced from the K parameter.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Discrete causal model view of biological networks

TL;DR: The presented cabin (Causal Analysis of Biological Interaction Network) method determines a causal model view composed of a subnetwork and a set of agent states deduced from observations with regards to a model of network dynamics.
Journal ArticleDOI

SEGN: Inferring real-time gene networks mediating phenotypic plasticity.

TL;DR: The integrated view of systems biology and the interactive notion of evolutionary game theory are integrated to reconstruct so-called systems evolutionary game networks (SEGN) that can autonomously detect, track, and visualize environment-induced gene networks along the time axis that characterize previously unknown gene co-regulation that modulates the time trajectories of trees’ response to salt stress.
Journal ArticleDOI

Natural biased coin encoded in the genome determines cell strategy.

TL;DR: A game theoretic approach is used to explain how rational decisions are made in the presence of cooperators and competitors and suggests the existence of an internal switch that operates as a biased coin.
Proceedings Article

Cascaded games

TL;DR: A novel model construction, cascaded games, is introduced that is intended to allow us to study the notion of steady states algebraically and structurally, and to analyse the models, using the recent notion of change-of-mind equilibria.
References
More filters
Book

The Origins of Order: Self-Organization and Selection in Evolution

TL;DR: The structure of rugged fitness landscapes and the structure of adaptive landscapes underlying protein evolution, and the architecture of genetic regulatory circuits and its evolution.
Journal ArticleDOI

Equilibrium points in n-person games

TL;DR: A concept of an n -person game in which each player has a finite set of pure strategies and in which a definite set of payments to the n players corresponds to each n -tuple ofpure strategies, one strategy being taken for each player.
Book ChapterDOI

Non-cooperative games

John F. Nash
TL;DR: In this article, it was shown that the set of equilibrium points of a two-person zero-sum game can be defined as a set of all pairs of opposing "good" strategies.
Journal ArticleDOI

Metabolic stability and epigenesis in randomly constructed genetic nets

TL;DR: The hypothesis that contemporary organisms are also randomly constructed molecular automata is examined by modeling the gene as a binary (on-off) device and studying the behavior of large, randomly constructed nets of these binary “genes”.
Book

Game Theory : Analysis of Conflict

TL;DR: In this article, the authors propose a game theoretic approach to games based on the Bayesian model and demonstrate the existence of Nash Equilibria and the Focal Point Effect.
Related Papers (5)
Frequently Asked Questions (16)
Q1. What contributions have the authors mentioned in the paper "Rewriting game theory as a foundation for state-based models of gene regulation" ?

The authors present a game-theoretic foundation for gene regulatory analysis based on the recent formalism of rewriting game theory. The formalism explicitly represents the dynamics of its Nash equilibria and, therefore, is a suitable foundation for the study of steady states in discrete modelling. The authors apply the formalism to the discrete analysis of gene regulatory networks introduced by R. Thomas and S. Kauffman. Specifically, the authors show that their models are specific instances of a C/P game deduced from the K parameter. 

Their future work concerns similar treatments of the various abstraction levels in between, namely chemical, biochemical, cellular, multi-cellular and environmental level. 

Conversion/preference (C/P) games have been designed as an abstraction over strategic-form games and as a game formalism that introduces as few concepts as possible. 

In other words, the authors have moved from the chemical abstraction level of protein binding and catalysis captured in expression games, up to the biochemical abstraction level of, e.g., phage λ’s lysogenic and lytic states. 

Clearly strategic-form games are instances of C/P games, conversions are one dimension move (for instance along a line or a column), while preferences are given by comparisons over payoffs: a synopsis is preferred by an agent over another if his payoff is larger in the former. 

The relevance of state-based analysis comes from the fact that the state in question has been observed to be (self-)sustainable: it is phage λ’s lysogenic state that “involves integration of the phage DNA into the bacterial chromosome [of its host] where it is passively replicated at each cell division — just as though it were a legitimate part of the bacterial genome” [21] 

s ′) – s ⊳g s ′ , K-Approxg(s, s ′) ∧ (∀g′ . g′ 6= g ⇒ πg′(s) = πg′(s′))be the synchronous respectively g-asynchronous preference relations. 

The notion of abstract Nash equilibrium specialises to Nash’s concrete form in the presence of the discussed structural constraints on strategic-form games. 

The rationale for the latter is that moving from a state to another involves a phase transition, which is costly in terms of energy, and two phase transitions should therefore not be considered atomically. 

A play of the game on the left is a path from the root to a leaf, where the first (second) number indicates the payoff to agent a1 (a2). 

In this paper, for example, the authors have shown that changeof-mind equilibria can be used to predict what gene expression will take place. 

For linear order g0 < . . . < gn, let gi ⊖ gj = i − j, and let s // ±1 s′ , ∀g ∈ G . | πg(s) ⊖ πg(s′) | ≤ 1A C/P game whose conversion fulfills the previous definition is called 1-restrained. 

In the example, the only probabilistic Nash equilibrium arises if both agents choose between their two options with equal probability for expected payoffs of a half to each. 

The game-theoretic perspective the authors provide is technically and conceptually beneficial because non-cooperative game theory is the embodiment of the compete-andcoexist reality of genes and because it allows us to leverage the independently developed theory of dynamic equilibria in rewriting game theory. 

The following definition says that a synopsis s, i.e., their abstraction over (combined) strategies, is an abstract Nash equilibrium if and only if all agents are happy, meaning that whenever an agent can convert s to s′ then it is not the case that he prefers s′ to s. 

The cycle between 〈cI 0, cro0〉 and 〈cI 1, cro1〉 is a known false positive of Kauffman’s model.cial, i.e., that they are inescapable, is the exact the justification for why they are both change-of-mind equilibria.