Decision-making problems in two-person games with aggregate information (Q1569377)

The paper deals with a two-person game with a fixed order of moves. To solve this problem, one has to solve complicated variational problems. The authors reduce these problems to much simpler optimization problems on the original and aggregated choice sets, the corresponding optimal strategies of the first player are found, and the necessary and sufficient conditions of exact aggregation (i.e., conditions under wich the gain of the first player obtained by making decisions based on aggregate information coincides with the gain he would get if his decisions were based on complete information) are obtained.