|
Complete Mixing
In evolutionary game theory, complete mixing refers to an assumption about the type of interactions that occur between individual organisms. Interactions between individuals in a population attains complete mixing if and only if the probably individual ''x'' interacts with individual ''y'' is equal for all ''y''. This assumption is implicit in the replicator equation a system of differential equations that represents one model in evolutionary game theory. This assumption usually does not hold for most organismic populations, since usually interactions occur in some spatial setting where individuals are more likely to interact with those around them. Although the assumption is empirically violated, it represents a certain sort of scientific idealization which may or may not be harmful to the conclusions reached by that model. This question has led individuals to investigate a series of other models where there is not complete mixing (e.g. Cellular automata A cellular automa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Evolutionary Game Theory
Evolutionary game theory (EGT) is the application of game theory to evolving populations in biology. It defines a framework of contests, strategies, and analytics into which Darwinian competition can be modelled. It originated in 1973 with John Maynard Smith and George R. Price's formalisation of contests, analysed as strategies, and the mathematical criteria that can be used to predict the results of competing strategies. Evolutionary game theory differs from classical game theory in focusing more on the dynamics of strategy change. This is influenced by the frequency of the competing strategies in the population. Evolutionary game theory has helped to explain the basis of altruistic behaviours in Darwinian evolution. It has in turn become of interest to economists, sociologists, anthropologists, and philosophers. History Classical game theory Classical non-cooperative game theory was conceived by John von Neumann to determine optimal strategies in competitions between adv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Replicator Equation
In mathematics, the replicator equation is a deterministic monotone non-linear and non-innovative game dynamic used in evolutionary game theory. The replicator equation differs from other equations used to model replication, such as the quasispecies equation, in that it allows the fitness function to incorporate the distribution of the population types rather than setting the fitness of a particular type constant. This important property allows the replicator equation to capture the essence of selection. Unlike the quasispecies equation, the replicator equation does not incorporate mutation and so is not able to innovate new types or pure strategies. Equation The most general continuous form of the replicator equation is given by the differential equation: : \dot = x_i f_i(x) - \phi(x) \quad \phi(x) = \sum_^ where x_i is the proportion of type i in the population, x=(x_1, \ldots, x_n) is the vector of the distribution of types in the population, f_i(x) is the fitness of type ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Differential Equations
In mathematics, a differential equation is an equation that relates one or more unknown functions and their derivatives. In applications, the functions generally represent physical quantities, the derivatives represent their rates of change, and the differential equation defines a relationship between the two. Such relations are common; therefore, differential equations play a prominent role in many disciplines including engineering, physics, economics, and biology. Mainly the study of differential equations consists of the study of their solutions (the set of functions that satisfy each equation), and of the properties of their solutions. Only the simplest differential equations are solvable by explicit formulas; however, many properties of solutions of a given differential equation may be determined without computing them exactly. Often when a closed-form expression for the solutions is not available, solutions may be approximated numerically using computers. The theory of d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Idealization (science Philosophy)
In philosophy of science, idealization is the process by which scientific models assume facts about the phenomenon being modeled that are strictly false but make models easier to understand or solve. That is, it is determined whether the phenomenon approximates an "ideal case," then the model is applied to make a prediction based on that ideal case. If an approximation is accurate, the model will have high predictive power; for example, it is not usually necessary to account for air resistance when determining the acceleration of a falling bowling ball, and doing so would be more complicated. In this case, air resistance is idealized to be zero. Although this is not strictly true, it is a good approximation because its effect is negligible compared to that of gravity. Idealizations may allow predictions to be made when none otherwise could be. For example, the approximation of air resistance as zero was the only option before the formulation of Stokes' law allowed the calcula ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cellular Automata
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. Cellular automata have found application in various areas, including physics, theoretical biology and microstructure modeling. A cellular automaton consists of a regular grid of ''cells'', each in one of a finite number of '' states'', such as ''on'' and ''off'' (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its ''neighborhood'' is defined relative to the specified cell. An initial state (time ''t'' = 0) is selected by assigning a state for each cell. A new ''generation'' is created (advancing ''t'' by 1), according to some fixed ''rule'' (generally, a mathematical function) that determines the new state of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game Theory
Game theory is the study of mathematical models of strategic interactions among rational agents. Myerson, Roger B. (1991). ''Game Theory: Analysis of Conflict,'' Harvard University Press, p.&nbs1 Chapter-preview links, ppvii–xi It has applications in all fields of social science, as well as in logic, systems science and computer science. Originally, it addressed two-person zero-sum games, in which each participant's gains or losses are exactly balanced by those of other participants. In the 21st century, game theory applies to a wide range of behavioral relations; it is now an umbrella term for the science of logical decision making in humans, animals, as well as computers. Modern game theory began with the idea of mixed-strategy equilibria in two-person zero-sum game and its proof by John von Neumann. Von Neumann's original proof used the Brouwer fixed-point theorem on continuous mappings into compact convex sets, which became a standard method in game theory and mathem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
