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.
Market concentrationIn economics, market concentration is a function of the number of firms and their respective shares of the total production (alternatively, total capacity or total reserves) in a market. Market concentration is the portion of a given market's market share that is held by a small number of businesses. To ascertain whether an industry is competitive or not, it is employed in antitrust law and economic regulation. When market concentration is high, it indicates that a few firms dominate the market and oligopoly or monopolistic competition is likely to exist.
Military strategyMilitary 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 the planning and conduct of campaigns, the movement and disposition of forces, and the deception of the enemy. The father of Western modern strategic studies, Carl von Clausewitz (1780–1831), defined military strategy as "the employment of battles to gain the end of war.
Prim's algorithmIn computer science, Prim's algorithm (also known as Jarník's algorithm) is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex.
Dijkstra's algorithmDijkstra's algorithm (ˈdaɪkstrəz ) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree.
Representativeness heuristicThe representativeness heuristic is used when making judgments about the probability of an event under uncertainty. It is one of a group of heuristics (simple rules governing judgment or decision-making) proposed by psychologists Amos Tversky and Daniel Kahneman in the early 1970s as "the degree to which [an event] (i) is similar in essential characteristics to its parent population, and (ii) reflects the salient features of the process by which it is generated".
Price warA price war is a form of market competition in which companies within an industry engage in aggressive pricing strategies, “characterized by the repeated cutting of prices below those of competitors”. This leads to a vicious cycle, where each competitor attempts to match or undercut the price of the other. Competitors are driven to follow the initial price-cut due to the downward pricing pressure, referred to as “price-cutting momentum”. Heil and Helsen (2001) proposed that a price war exists only if one or more of a set of qualitative conditions are satisfied.
Consumer choiceThe theory of consumer choice is the branch of microeconomics that relates preferences to consumption expenditures and to consumer demand curves. It analyzes how consumers maximize the desirability of their consumption (as measured by their preferences subject to limitations on their expenditures), by maximizing utility subject to a consumer budget constraint. Factors influencing consumers' evaluation of the utility of goods include: income level, cultural factors, product information and physio-psychological factors.
Root-finding algorithmsIn mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number x such that f(x) = 0. As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeros, expressed either as floating-point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound).
Dynamic stochastic general equilibriumDynamic stochastic general equilibrium modeling (abbreviated as DSGE, or DGE, or sometimes SDGE) is a macroeconomic method which is often employed by monetary and fiscal authorities for policy analysis, explaining historical time-series data, as well as future forecasting purposes. DSGE econometric modelling applies general equilibrium theory and microeconomic principles in a tractable manner to postulate economic phenomena, such as economic growth and business cycles, as well as policy effects and market shocks.
