Split (1)

train · 14.5k rows

text stringlengths 559 401k	source stringlengths 13 121
In mathematics, the Laplace transform, named after Pierre-Simon Laplace (), is an integral transform that converts a function of a real variable (usually t {\displaystyle t} , in the time domain) to a function of a complex variable s {\d...	Wikipedia/Laplace_transform
In physics, Newtonian dynamics (also known as Newtonian mechanics) is the study of the dynamics of a particle or a small body according to Newton's laws of motion. == Mathematical generalizations == Typically, the Newtonian dynamics occurs in a three-dimensional Euclidean space, which is flat. However, in mathematics...	Wikipedia/Newtonian_dynamics
Common integrals in quantum field theory are all variations and generalizations of Gaussian integrals to the complex plane and to multiple dimensions.: 13–15 Other integrals can be approximated by versions of the Gaussian integral. Fourier integrals are also considered. == Variations on a simple Gaussian integral ==...	Wikipedia/Common_integrals_in_quantum_field_theory
Calculus (from Latin calculus meaning ‘pebble’, plural calculī) in its most general sense is any method or system of calculation. Calculus may refer to: == Biology == Calculus (spider), a genus of the family Oonopidae Caseolus calculus, a genus and species of small land snails == Medicine == Calculus (dental), de...	Wikipedia/Calculus_(disambiguation)
The truncated Newton method, originated in a paper by Ron Dembo and Trond Steihaug, also known as Hessian-free optimization, are a family of optimization algorithms designed for optimizing non-linear functions with large numbers of independent variables. A truncated Newton method consists of repeated application of an ...	Wikipedia/Truncated_Newton_method
In continuum mechanics, the infinitesimal strain theory is a mathematical approach to the description of the deformation of a solid body in which the displacements of the material particles are assumed to be much smaller (indeed, infinitesimally smaller) than any relevant dimension of the body; so that its geometry and...	Wikipedia/Infinitesimal_strain_theory
In nonstandard analysis, the standard part function is a function from the limited (finite) hyperreal numbers to the real numbers. Briefly, the standard part function "rounds off" a finite hyperreal to the nearest real. It associates to every such hyperreal x {\displaystyle x} ...	Wikipedia/Standard_part_function
In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide a tool for the high-level description of interactions, communications, and synchronizations between a collection of independent agents or processes...	Wikipedia/Process_calculus
In mathematics, nonstandard calculus is the modern application of infinitesimals, in the sense of nonstandard analysis, to infinitesimal calculus. It provides a rigorous justification for some arguments in calculus that were previously considered merely heuristic. Non-rigorous calculations with infinitesimals were wide...	Wikipedia/Nonstandard_calculus
Fractional calculus is a branch of mathematical analysis that studies the several different possibilities of defining real number powers or complex number powers of the differentiation operator D {\displaystyle D} D f ( x ...	Wikipedia/Fractional_calculus
In mathematics, generalized functions are objects extending the notion of functions on real or complex numbers. There is more than one recognized theory, for example the theory of distributions. Generalized functions are especially useful for treating discontinuous functions more like smooth functions, and describing ...	Wikipedia/Generalized_function
The method of exhaustion (Latin: methodus exhaustionis) is a method of finding the area of a shape by inscribing inside it a sequence of polygons (one at a time) whose areas converge to the area of the containing shape. If the sequence is correctly constructed, the difference in area between the nth polygon and the con...	Wikipedia/Method_of_exhaustion
Classical mechanics is a physical theory describing the motion of objects such as projectiles, parts of machinery, spacecraft, planets, stars, and galaxies. The development of classical mechanics involved substantial change in the methods and philosophy of physics. The qualifier classical distinguishes this type of mec...	Wikipedia/Classical_mechanics
In physics, a force is an influence that can cause an object to change its velocity unless counterbalanced by other forces. In mechanics, force makes ideas like 'pushing' or 'pulling' mathematically precise. Because the magnitude and direction of a force are both important, force is a vector quantity. The SI unit of fo...	Wikipedia/Force
Newton–Cartan theory (or geometrized Newtonian gravitation) is a geometrical re-formulation, as well as a generalization, of Newtonian gravity first introduced by Élie Cartan in 1923 and Kurt Friedrichs and later developed by G. Dautcourt, W. G. Dixon, P. Havas, H. Künzle, Andrzej Trautman, and others. In this re-form...	Wikipedia/Newton–Cartan_theory
The Schrödinger–Newton equation, sometimes referred to as the Newton–Schrödinger or Schrödinger–Poisson equation, is a nonlinear modification of the Schrödinger equation with a Newtonian gravitational potential, where the gravitational potential emerges from the treatment of the wave function as a mass density, includi...	Wikipedia/Schrödinger–Newton_equation
De analysi per aequationes numero terminorum infinitas (or On analysis by infinite series, On Analysis by Equations with an infinite number of terms, or On the Analysis by means of equations of an infinite number of terms) is a mathematical work by Isaac Newton. == Creation == Composed in 1669, during the mid-part of...	Wikipedia/De_analysi_per_aequationes_numero_terminorum_infinitas
In mathematics, a rate is the quotient of two quantities, often represented as a fraction. If the divisor (or fraction denominator) in the rate is equal to one expressed as a single unit, and if it is assumed that this quantity can be changed systematically (i.e., is an independent variable), then the dividend (the fra...	Wikipedia/Rate_of_change_(mathematics)
Statistical Physics of Particles and Statistical Physics of Fields are a two-volume series of textbooks by Mehran Kardar. Each book is based on a semester-long course taught by Kardar at the Massachusetts Institute of Technology. They cover statistical physics and thermodynamics at the graduate level. == Editions == ...	Wikipedia/Statistical_Physics_of_Particles
In mathematics, calculus on Euclidean space is a generalization of calculus of functions in one or several variables to calculus of functions on Euclidean space R n {\displaystyle \mathbb {R} ^{n}} ...	Wikipedia/Calculus_on_Euclidean_space
Actuarial science is the discipline that applies mathematical and statistical methods to assess risk in insurance, pension, finance, investment and other industries and professions. Actuaries are professionals trained in this discipline. In many countries, actuaries must demonstrate their competence by passing a series...	Wikipedia/Actuarial_science
In science, work is the energy transferred to or from an object via the application of force along a displacement. In its simplest form, for a constant force aligned with the direction of motion, the work equals the product of the force strength and the distance traveled. A force is said to do positive work if it has a...	Wikipedia/Work_(physics)
In optics, the corpuscular theory of light states that light is made up of small discrete particles called "corpuscles" (little particles) which travel in a straight line with a finite velocity and possess impetus. This notion was based on an alternate description of atomism of the time period. Isaac Newton laid the fo...	Wikipedia/Corpuscular_theory_of_light
In symbolic computation, the Risch algorithm is a method of indefinite integration used in some computer algebra systems to find antiderivatives. It is named after the American mathematician Robert Henry Risch, a specialist in computer algebra who developed it in 1968. The algorithm transforms the problem of integratio...	Wikipedia/Risch_algorithm
In mathematics, an integral transform is a type of transform that maps a function from its original function space into another function space via integration, where some of the properties of the original function might be more easily characterized and manipulated than in the original function space. The transformed fu...	Wikipedia/Integral_transform
Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum of two prime numbers. The conjecture has been shown to hold for all integers less than 4×1018 but remains unproven despite considerable ...	Wikipedia/Goldbach_conjecture
In mathematics, a zeta function is (usually) a function analogous to the original example, the Riemann zeta function ζ ( s ) = ∑ n = 1 ∞ ...	Wikipedia/Zeta_function
The French Academy of Sciences (French: Académie des sciences, [akademi de sjɑ̃s]) is a learned society, founded in 1666 by Louis XIV at the suggestion of Jean-Baptiste Colbert, to encourage and protect the spirit of French scientific research. It was at the forefront of scientific developments in Europe in the 17th an...	Wikipedia/Académie_des_sciences
In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic behaviour of the Riemann zeta function. The various studies of the behaviour of the divisor function are sometimes called divisor problems. == Definition == The d...	Wikipedia/Divisor_summatory_function
Selenographia, sive Lunae descriptio (Selenography, or A Description of The Moon) was printed in 1647 and is a milestone work by Johannes Hevelius. It includes the first detailed map of the Moon, created from Hevelius's personal observations. In his treatise, Hevelius reflected on the difference between his own work an...	Wikipedia/Selenographia
In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer (the dividend) by another (the divisor), in a way that produces an integer quotient and a natural number remainder strictly smaller than the absolute value of the divisor. A fundamental property is that the quoti...	Wikipedia/Euclid's_division_lemma
In the mathematical field of group theory, Lagrange's theorem states that if H is a subgroup of any finite group G, then \| H \| {\displaystyle \|H\|} is a divisor of \| G ...	Wikipedia/Lagrange's_theorem_(group_theory)
In number theory, the partition function p(n) represents the number of possible partitions of a non-negative integer n. For instance, p(4) = 5 because the integer 4 has the five partitions 1 + 1 + 1 + 1, 1 + 1 + 2, 1 + 3, 2 + 2, and 4. No closed-form expression for the partition function is known, but it has both asymp...	Wikipedia/Partition_function_(number_theory)
In algebra and number theory, a distribution is a function on a system of finite sets into an abelian group which is analogous to an integral: it is thus the algebraic analogue of a distribution in the sense of generalised function. The original examples of distributions occur, unnamed, as functions φ on Q/Z satisfying...	Wikipedia/Distribution_(number_theory)
In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold for a number, then the same would be true for a smaller number, leading t...	Wikipedia/Method_of_infinite_descent
In algebra and number theory, Euclid's lemma is a lemma that captures a fundamental property of prime numbers: For example, if p = 19, a = 133, b = 143, then ab = 133 × 143 = 19019, and since this is divisible by 19, the lemma implies that one or both of 133 or 143 must be as well. In fact, 133 = 19 × 7. The lemma fi...	Wikipedia/Euclid's_lemma
In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer (including 1 and the number itself). It appears in a number of remarkable identities, including ...	Wikipedia/Divisor_function
In mathematics, the Hardy–Ramanujan–Littlewood circle method is a technique of analytic number theory. It is named for G. H. Hardy, S. Ramanujan, and J. E. Littlewood, who developed it in a series of papers on Waring's problem. == History == The initial idea is usually attributed to the work of Hardy with Srinivasa R...	Wikipedia/Circle_method
In mathematics, an L-function is a meromorphic function on the complex plane, associated to one out of several categories of mathematical objects. An L-series is a Dirichlet series, usually convergent on a half-plane, that may give rise to an L-function via analytic continuation. The Riemann zeta function is an example...	Wikipedia/L-functions
In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, for which only integer solutions are of interest. A linear Diophantine equation equates the sum of two or more unknowns, with coefficients, to a constant. An exponential Diophantine...	Wikipedia/Diophantine_equations
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). A Fourier transform converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a se...	Wikipedia/Fast_Fourier_transform
Independence is a fundamental notion in probability theory, as in statistics and the theory of stochastic processes. Two events are independent, statistically independent, or stochastically independent if, informally speaking, the occurrence of one does not affect the probability of occurrence of the other or, equivale...	Wikipedia/Independence_(probability_theory)
A number is a mathematical object used to count, measure, and label. The most basic examples are the natural numbers 1, 2, 3, 4, and so forth. Numbers can be represented in language with number words. More universally, individual numbers can be represented by symbols, called numerals; for example, "5" is a numeral that...	Wikipedia/Number_systems
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of pu...	Wikipedia/Public-key_cryptography
In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis. == Scope == Arithmetic combinatorics is about combinatorial estimates associated with arithmetic operations (addition, subtraction, multiplication, and division). Additive co...	Wikipedia/Combinatorial_number_theory
The chakravala method (Sanskrit: चक्रवाल विधि) is a cyclic algorithm to solve indeterminate quadratic equations, including Pell's equation. It is commonly attributed to Bhāskara II, (c. 1114 – 1185 CE) although some attribute it to Jayadeva (c. 950 ~ 1000 CE). Jayadeva pointed out that Brahmagupta's approach to solvin...	Wikipedia/Chakravala_method
In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity, which are integers x and y such that a x ...	Wikipedia/Extended_Euclidean_algorithm
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example, rational numbers), or defined as generalizations of the integers (for exam...	Wikipedia/Elementary_number_theory
In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle. It states that the area of the square whose side is the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares on the other ...	Wikipedia/Pythagorean_equation
In number theory, the first Hardy–Littlewood conjecture states the asymptotic formula for the number of prime k-tuples less than a given magnitude by generalizing the prime number theorem. It was first proposed by G. H. Hardy and John Edensor Littlewood in 1923. == Statement == Let ...	Wikipedia/Hardy–Littlewood_conjecture
In mathematics, an algebraic surface is an algebraic variety of dimension two. In the case of geometry over the field of complex numbers, an algebraic surface has complex dimension two (as a complex manifold, when it is non-singular) and so of dimension four as a smooth manifold. The theory of algebraic surfaces is muc...	Wikipedia/Algebraic_surface
A twin prime is a prime number that is either 2 less or 2 more than another prime number—for example, either member of the twin prime pair (17, 19) or (41, 43). In other words, a twin prime is a prime that has a prime gap of two. Sometimes the term twin prime is used for a pair of twin primes; an alternative name for...	Wikipedia/Twin_prime_conjecture
In number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. It is written using the Greek letter phi as φ ( n ) {\displaystyle \varphi (n)} or ϕ ( ...	Wikipedia/Euler's_totient_function
In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by π(x) (unrelated to the number π). A symmetric variant seen sometimes is π0(x), which is equal to π(x) − 1⁄2 if x is exactly a prime number, and equal to π(x) otherw...	Wikipedia/Prime-counting_function
Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice in R n , {\displaystyle \m...	Wikipedia/Geometric_number_theory
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated by rational numbers. For this problem, a rational number p/q is a "good" approx...	Wikipedia/Diophantine_approximations
Pell's equation, also called the Pell–Fermat equation, is any Diophantine equation of the form x 2 − n y 2 = 1 , {\displayst...	Wikipedia/Pell_equation
In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, for which only integer solutions are of interest. A linear Diophantine equation equates the sum of two or more unknowns, with coefficients, to a constant. An exponential Diophantine...	Wikipedia/Linear_Diophantine_equation
Pell's equation, also called the Pell–Fermat equation, is any Diophantine equation of the form x 2 − n y 2 = 1 , {\displayst...	Wikipedia/Pell's_equation
Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum of two prime numbers. The conjecture has been shown to hold for all integers less than 4×1018 but remains unproven despite considerable ...	Wikipedia/Goldbach's_conjecture
An Introduction to the Theory of Numbers is a classic textbook in the field of number theory, by G. H. Hardy and E. M. Wright. It is on the list of 173 books essential for undergraduate math libraries. The book grew out of a series of lectures by Hardy and Wright and was first published in 1938. The third edition add...	Wikipedia/An_Introduction_to_the_Theory_of_Numbers
Proof by exhaustion, also known as proof by cases, proof by case analysis, complete induction or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases or sets of equivalent cases, and where each type of case is checked to see if the proposit...	Wikipedia/Brute_force_method
The term figurate number is used by different writers for members of different sets of numbers, generalizing from triangular numbers to different shapes (polygonal numbers) and different dimensions (polyhedral numbers). The ancient Greek mathematicians already considered triangular numbers, polygonal numbers, tetrahedr...	Wikipedia/Figurate_numbers
In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion of a ring ideal of abstract algebra, it has subsequently been generalized to a different notion. Ideals are of great importance for many constructions in order and l...	Wikipedia/Ideal_(order_theory)
In commutative and homological algebra, the grade of a finitely generated module M {\displaystyle M} over a Noetherian ring R {\displaystyle R} is a cohomological invariant defined by vanishing of Ext-modules ...	Wikipedia/Grade_(ring_theory)
In mathematics, a finitely generated module is a module that has a finite generating set. A finitely generated module over a ring R may also be called a finite R-module, finite over R, or a module of finite type. Related concepts include finitely cogenerated modules, finitely presented modules, finitely related modules...	Wikipedia/Finitely_generated_module
Zorn's lemma, also known as the Kuratowski–Zorn lemma, is a proposition of set theory. It states that a partially ordered set containing upper bounds for every chain (that is, every totally ordered subset) necessarily contains at least one maximal element. The lemma was proved (assuming the axiom of choice) by Kazimier...	Wikipedia/Zorn's_lemma
Nuclear strategy involves the development of doctrines and strategies for the production and use of nuclear weapons. As a sub-branch of military strategy, nuclear strategy attempts to match nuclear weapons as means to political ends. In addition to the actual use of nuclear weapons whether in the battlefield or strateg...	Wikipedia/Nuclear_strategy
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 ...	Wikipedia/Evolutionary_Game_Theory
Price controls are restrictions set in place and enforced by governments, on the prices that can be charged for goods and services in a market. The intent behind implementing such controls can stem from the desire to maintain affordability of goods even during shortages, and to slow inflation, or alternatively to ensur...	Wikipedia/Price_controls
In game theory, the graphical form or graphical game is an alternate compact representation of strategic interactions that efficiently models situations where players' outcomes depend only on a subset of other players. First formalized by Michael Kearns, Michael Littman, and Satinder Singh in 2001, this approach comple...	Wikipedia/Graphical_game_theory
In mechanism design, monotonicity is a property of a social choice function. It is a necessary condition for being able to implement such a function using a strategyproof mechanism. Its verbal description is: If changing one agent's type (while keeping the types of other agents fixed) changes the outcome under the soc...	Wikipedia/Monotonicity_(mechanism_design)
The theory of the firm consists of a number of economic theories that explain and predict the nature of the firm, company, or corporation, including its existence, behaviour, structure, and relationship to the market. Firms are key drivers in economics, providing goods and services in return for monetary payments and r...	Wikipedia/Theory_of_the_firm
A strategy game or strategic game is a game in which the players' uncoerced, and often autonomous, decision-making skills have a high significance in determining the outcome. Almost all strategy games require internal decision tree-style thinking, and typically very high situational awareness. Strategy games are also s...	Wikipedia/Strategy_game
The managerial grid model or managerial grid theory (1964) is a model, developed by Robert R. Blake and Jane Mouton, of leadership styles. This model originally identified five different leadership styles based on the concern for people and the concern for production. The optimal leadership style in this model is based...	Wikipedia/Managerial_grid_model
In game theory, farsightness refers to players’ ability to consider the long-term consequences of their strategies, beyond immediate payoffs, often formalized as farsighted stability where players anticipate future moves and stable outcomes. In static games, players optimize payoffs based on current information, as in...	Wikipedia/Farsightedness_(game_theory)
In game theory, a Markov strategy is a strategy that depends only on the current state of the game, rather than the full history of past actions. The state summarizes all relevant past information needed for decision-making. For example, in a repeated game, the state could be the outcome of the most recent round or any...	Wikipedia/Markov_strategy
In microeconomics, the Bertrand–Edgeworth model of price-setting oligopoly explores what happens when firms compete to sell a homogeneous product (a good for which consumers buy only from the cheapest available seller) but face limits on how much they can supply. Unlike in the standard Bertrand competition model, where...	Wikipedia/Bertrand–Edgeworth_model
In mechanism design, a strategyproof (SP) mechanism is a game form in which each player has a weakly-dominant strategy, so that no player can gain by "spying" over the other players to know what they are going to play. When the players have private information (e.g. their type or their value to some item), and the stra...	Wikipedia/Strategyproofness
Economic methodology is the study of methods, especially the scientific method, in relation to economics, including principles underlying economic reasoning. In contemporary English, 'methodology' may reference theoretical or systematic aspects of a method (or several methods). Philosophy and economics also takes ...	Wikipedia/Economic_methodology
Philosophy of science is the branch of philosophy concerned with the foundations, methods, and implications of science. Amongst its central questions are the difference between science and non-science, the reliability of scientific theories, and the ultimate purpose and meaning of science as a human endeavour. Philosop...	Wikipedia/Philosophy_of_science
In game theory, a strategy A dominates another strategy B if A will always produce a better result than B, regardless of how any other player plays. Some very simple games (called straightforward games) can be solved using dominance. == Terminology == A player can compare two strategies, A and B, to determine which o...	Wikipedia/Strategic_dominance
Family therapy (also referred to as family counseling, family systems therapy, marriage and family therapy, couple and family therapy) is a branch of psychotherapy focused on families and couples in intimate relationships to nurture change and development. It tends to view change in terms of the systems of interaction ...	Wikipedia/Family_therapy
Evolution and the Theory of Games is a book by the British evolutionary biologist John Maynard Smith on evolutionary game theory. The book was initially published in December 1982 by Cambridge University Press. == Overview == In the book, John Maynard Smith summarises work on evolutionary game theory that had develop...	Wikipedia/Evolution_and_the_Theory_of_Games
In game theory, a cooperative game (or coalitional game) is a game with groups of players who form binding “coalitions” with external enforcement of cooperative behavior (e.g. through contract law). This is different from non-cooperative games in which there is either no possibility to forge alliances or all agreements...	Wikipedia/Cooperative_game_theory
The optional prisoner's dilemma (OPD) game models a situation of conflict involving two players in game theory. It can be seen as an extension of the standard prisoner's dilemma game, where players have the option to "reject the deal", that is, to abstain from playing the game. This type of game can be used as a model ...	Wikipedia/Optional_prisoner's_dilemma
In game theory, the battle of the sexes is a two-player coordination game that also involves elements of conflict. The game was introduced in 1957 by R. Duncan Luce and Howard Raiffa in their classic book, Games and Decisions. Some authors prefer to avoid assigning sexes to the players and instead use Players 1 and 2, ...	Wikipedia/Battle_of_the_sexes_(game_theory)
The Great Transformation is a book by Karl Polanyi, a Hungarian political economist. First published in 1944 by Farrar & Rinehart, it deals with the social and political upheavals that took place in England during the rise of the market economy. Polanyi contends that the modern market economy and the modern nation-stat...	Wikipedia/The_Great_Transformation_(book)
In game theory, differential games are dynamic games that unfold in continuous time, meaning players’ actions and outcomes evolve smoothly rather than in discrete steps, and for which the rate of change of each state variable—like position, speed, or resource level—is governed by a differential equation. This distingui...	Wikipedia/Differential_game
In economics, general equilibrium theory attempts to explain the behavior of supply, demand, and prices in a whole economy with several or many interacting markets, by seeking to prove that the interaction of demand and supply will result in an overall general equilibrium. General equilibrium theory contrasts with the ...	Wikipedia/General_equilibrium_theory
Behavioural science is the branch of science concerned with human behaviour. While the term can technically be applied to the study of behaviour amongst all living organisms, it is nearly always used with reference to humans as the primary target of investigation (though animals may be studied in some instances, e.g. i...	Wikipedia/Behavioral_science
Forced displacement (also forced migration or forced relocation) is an involuntary or coerced movement of a person or people away from their home or home region. The UNHCR defines 'forced displacement' as follows: displaced "as a result of persecution, conflict, generalized violence or human rights violations". A forci...	Wikipedia/Forced_displacement
A strategic move in game theory is an action taken by a player outside the defined actions of the game in order to gain a strategic advantage and increase one's payoff. Strategic moves can either be unconditional moves or response rules. The key characteristics of a strategic move are that it involves a commitment from...	Wikipedia/Strategic_move
Military strategy is a set of ideas implemented by military organizations to pursue desired strategic goals. Derived from the Greek word strategos, the term strategy, when first used during the 18th century, was seen in its narrow sense as the "art of the general", or "the art of arrangement" of troops. and deals with ...	Wikipedia/Military_strategy
Military science fiction is a subgenre of science fiction and military fiction that depicts the use of science fiction technology, including spaceships and weapons, for military purposes and usually principal characters who are members of a military organization, usually during a war; occurring sometimes in outer space...	Wikipedia/Military_science_fiction
In game theory, Deadlock is a game where the action that is mutually most beneficial is also dominant. This provides a contrast to the Prisoner's Dilemma where the mutually most beneficial action is dominated. This makes Deadlock of rather less interest, since there is no conflict between self-interest and mutual bene...	Wikipedia/Deadlock_(game_theory)
In game theory, asynchrony refers to a gameplay structure where interactions and decisions do not occur in uniformly timed rounds. Unlike synchronous systems, where agents act in coordination with a shared timing mechanism, asynchronous systems lack a global clock, allowing agents to operate at independent and arbitrar...	Wikipedia/Asynchrony_(game_theory)
Market design is an interdisciplinary, engineering-driven approach to economics and a practical methodology for creation of markets of certain properties, which is partially based on mechanism design. In market design, the focus is on the rules of exchange, meaning who gets allocated what and by what procedure. Market ...	Wikipedia/Market_design
From a legal point of view, a contract is an institutional arrangement for the way in which resources flow, which defines the various relationships between the parties to a transaction or limits the rights and obligations of the parties. From an economic perspective, contract theory studies how economic actors can and ...	Wikipedia/Contract_theory
In two-or-more-player sequential games, a ply is one turn taken by one of the players. The word is used to clarify what is meant when one might otherwise say "turn". The word "turn" can be a problem since it means different things in different traditions. For example, in standard chess terminology, one move consists ...	Wikipedia/Ply_(game_theory)

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.