Game theory -- Linear programming problem

111 Views Asked by At

Can someone please help me with this question, I don't even know where to start.

enter image description here

For part bi) I think the answer is

$ minimise \sum_{i=1}^{m} x_{i} = \frac{1}{v} subject to \sum_{i=1}^{m}a_{ij} x_{i} \geq 1 $

don't know how to write the LP for player B?

And i have no idea how to do part (bii) Please could anyone help me with this part.