Additively-Separable Sum Linear Programming Games

[somdeb...@gmail.com]

Dear All:

This is a new paper on two-person games, with the strategy set of one player being a bounded closed convex polytope.

https://doi.org/10.31224/5736

An example of such games would be a “Minmax Stochastic Linear Programming” game.

Since, unlike the special case of the set of a simple, in general the extreme points of a polytope may not be linearly independent, such games are not representable as “bi-matrix games” in any obvious sense.

I will be glad to receive your valuable comments on the paper.

Thanks and best.

Somdeb.  

P.S. There is a follow-up on TPASS game available here: https://doi.org/10.31224/5441