Now showing items 1-2 of 2
Finite approximations to a zero-sum game with incomplete information
(Physica-Verlag; Springer Science+Business Media, 1990-03)
In this paper, we investigate a scheme for approximating a two-person zero-sum game G of incomplete information by means of a natural system G mn of its finite subgames. The main question is: For large m and n , is an ...
On the growth of random knapsacks
(Elsevier, 1990-09)
We consider the problem of optimally filling a knapsack of fixed capacity by choosing from among a collection of n objects of randomly determined weight and value. Under very mild conditions on the common joint distribution ...