The state-of-the-art is that only symmetric games can be solved
efficiently, and thus the linear games supported by Dunshire are a
-bastard of the two: the cones are symmetric, but the players get to
-choose two interior points.
+compromise between the two: the cones are symmetric, but the players
+get to choose two interior points.
In this game, we have two players who are competing for a "payoff."
There is a symmetric cone :math:`K`, a linear transformation :math:`L`