Strategy (game theory)In game theory, a player's strategy is any of the options which they choose in a setting where the outcome depends not only on their own actions but on the actions of others. The discipline mainly concerns the action of a player in a game affecting the behavior or actions of other players. Some examples of "games" include chess, bridge, poker, monopoly, diplomacy or battleship. A player's strategy will determine the action which the player will take at any stage of the game.
Euclidean planeIn mathematics, a Euclidean plane is a Euclidean space of dimension two, denoted E2. It is a geometric space in which two real numbers are required to determine the position of each point. It is an affine space, which includes in particular the concept of parallel lines. It has also metrical properties induced by a distance, which allows to define circles, and angle measurement. A Euclidean plane with a chosen Cartesian coordinate system is called a Cartesian plane.
Bayesian gameIn game theory, a Bayesian game is a strategic decision-making model which assumes players have incomplete information. Players hold private information relevant to the game, meaning that the payoffs are not common knowledge. Bayesian games model the outcome of player interactions using aspects of Bayesian probability. They are notable because they allowed, for the first time in game theory, for the specification of the solutions to games with incomplete information. Hungarian economist John C.
Experimental economicsExperimental economics is the application of experimental methods to study economic questions. Data collected in experiments are used to estimate effect size, test the validity of economic theories, and illuminate market mechanisms. Economic experiments usually use cash to motivate subjects, in order to mimic real-world incentives. Experiments are used to help understand how and why markets and other exchange systems function as they do. Experimental economics have also expanded to understand institutions and the law (experimental law and economics).
Coordination gameA coordination game is a type of simultaneous game found in game theory. It describes the situation where a player will earn a higher payoff when they select the same course of action as another player. The game is not one of pure conflict, which results in multiple pure strategy Nash equilibria in which players choose matching strategies. Figure 1 shows a 2-player example.
Dual numberIn algebra, the dual numbers are a hypercomplex number system first introduced in the 19th century. They are expressions of the form a + bε, where a and b are real numbers, and ε is a symbol taken to satisfy with . Dual numbers can be added component-wise, and multiplied by the formula which follows from the property ε^2 = 0 and the fact that multiplication is a bilinear operation. The dual numbers form a commutative algebra of dimension two over the reals, and also an Artinian local ring.
Polar topologyIn functional analysis and related areas of mathematics a polar topology, topology of -convergence or topology of uniform convergence on the sets of is a method to define locally convex topologies on the vector spaces of a pairing.
Extreme pointIn mathematics, an extreme point of a convex set in a real or complex vector space is a point in which does not lie in any open line segment joining two points of In linear programming problems, an extreme point is also called vertex or corner point of Throughout, it is assumed that is a real or complex vector space.
Dual quaternionIn mathematics, the dual quaternions are an 8-dimensional real algebra isomorphic to the tensor product of the quaternions and the dual numbers. Thus, they may be constructed in the same way as the quaternions, except using dual numbers instead of real numbers as coefficients. A dual quaternion can be represented in the form A + εB, where A and B are ordinary quaternions and ε is the dual unit, which satisfies ε2 = 0 and commutes with every element of the algebra. Unlike quaternions, the dual quaternions do not form a division algebra.
Polygamma functionIn mathematics, the polygamma function of order m is a meromorphic function on the complex numbers defined as the (m + 1)th derivative of the logarithm of the gamma function: Thus holds where ψ(z) is the digamma function and Γ(z) is the gamma function. They are holomorphic on . At all the nonpositive integers these polygamma functions have a pole of order m + 1. The function ψ(1)(z) is sometimes called the trigamma function. Digamma function#Integral representations When m > 0 and Re z > 0, the polygamma function equals where is the Hurwitz zeta function.