doc/README.rst

   1 Dunshire is a `CVXOPT <http://cvxopt.org/>`_-based library for solving
   2 linear (cone) games. The notion of a symmetric linear (cone) game was
   3 introduced by Gowda and Ravindran in *On the game-theoretic value of a
   4 linear transformation relative to a self-dual cone*. I've extended
   5 their results to asymmetric cones and two interior points in my
   6 thesis, which does not exist yet.
   7
   8 The main idea can be gleaned from Gowda and Ravindran, however.
   9 Additional details and our problem formulation can be found in the
  10 full Dunshire documentation. The state-of-the-art is that only
  11 symmetric games can be solved efficiently, and thus the linear games
  12 supported by Dunshire are a compromise between the two: the cones are
  13 symmetric, but the players get to choose two interior points.
  14
  15 Only the nonnegative orthant and the ice-cream cone are supported at
  16 the moment. The symmetric positive-semidefinite cone is coming soon.