A method of the finite approximation of continuous noncooperative two-person games is
presented. The method is based on sampling the functional spaces, which serve as the sets …

A theory of refining pure strategy efficient Nash equilibria in finite noncooperative games
under uncertainty is outlined. The theory is based on guaranteeing the corresponding …

In a game problem, when the situation is formulated as the gain of one equals the loss of
other, the game is called zero-sum. But actually, one player's win is not always the other's …

The concept of proper equilibrium was established as a strict refinement of perfect
equilibrium. This establishment has significantly advanced the development of game theory …

We provide the first pivoting-type algorithm that computes an exact proper equilibrium of a
bimatrix game. This is achieved by using Lemke's algorithm to solve a linear …

State-based games are an extension of normal games since an underlying state space is
introduced, and the equilibrium in state-based games is called recurrent state equilibrium …

A tractable method of solving noncooperative 2-person games in which strategies are
staircase functions is suggested. The solution is meant to be Pareto-efficient. The method …

Background. A problem of selecting amongst efficient Nash equilibria is solved by refining
them. The existing approaches to refining do not guarantee that the refined efficient Nash …

As a strict refinement of Nash equilibrium, the concept of perfect equilibrium was formulated
by Selten (Int J Game Theory 4 (1): 25–55, 1975). A well-known application of this concept is …

A method of finite uniform approximation of two-person games in staircase-function infinite
spaces is presented. A pure strategy of the player is a staircase function defined on a time …