From: Michael Orlitzky Date: Wed, 18 Feb 2026 01:12:52 +0000 (-0500) Subject: doc/README.rst: minor updates X-Git-Url: https://gitweb.michael.orlitzky.com/?a=commitdiff_plain;h=919abe09af2a81e772b83b2d8040152622aa7f8d;p=dunshire.git doc/README.rst: minor updates --- diff --git a/doc/README.rst b/doc/README.rst index afa8d46..a5809f7 100644 --- a/doc/README.rst +++ b/doc/README.rst @@ -1,16 +1,18 @@ -Dunshire is a `CVXOPT `_-based library for solving -linear (cone) games. The notion of a symmetric linear (cone) game was -introduced by Gowda and Ravindran in *On the game-theoretic value of a -linear transformation relative to a self-dual cone*. I've extended -their results to asymmetric cones and two interior points in my -thesis, which does not exist yet. +Dunshire is a `CVXOPT `_-based library for +solving symmetric linear cone games. These games were introduced by +Gowda and Ravindran, and in my thesis I extended their results to +asymmetric cones with two independent interior points. + +* `On the game-theoretic value of a linear transformation relative to a self-dual cone `_ by Gowda and Ravindran. +* `Positive operators, Z-operators, Lyapunov rank, and linear games on closed convex cones `_, by Michael Orlitzky. The main idea can be gleaned from Gowda and Ravindran, however. Additional details and our problem formulation can be found in the -full Dunshire documentation. The state-of-the-art is that only +full Dunshire documentation. The state of the art is that only symmetric games can be solved efficiently, and thus the linear games supported by Dunshire are a compromise between the two: the cones are symmetric, but the players get to choose two interior points. Only the nonnegative orthant and the ice-cream cone are supported at -the moment. The symmetric positive-semidefinite cone is coming soon. +the moment. The symmetric PSD cone would not be hard to add, but +currently there is no interest.