X-Git-Url: https://gitweb.michael.orlitzky.com/?p=dunshire.git;a=blobdiff_plain;f=doc%2Fsource%2Foverview.rst;h=37e467a413172a447f6f69ab89e2239f33f58769;hp=d20cbe4d15bf23f71d684be97214af6b397235c5;hb=4c946acce00821cab415ca7ed3af30df2ccf120d;hpb=4a1433f8dc0aec61f6396e14b98c0f11f10ce0e4

diff --git a/doc/source/overview.rst b/doc/source/overview.rst
index d20cbe4..37e467a 100644
--- a/doc/source/overview.rst
+++ b/doc/source/overview.rst
@@ -1,10 +1,10 @@
 Overview
 --------
 
-Dunshire is a library for solving linear (cone) games. The notion of a
-symmetric linear (cone) game was introduced by Gowda and Ravindran
-[GowdaRav]_, and extended by Orlitzky to asymmetric cones with two
-interior points.
+Dunshire is a library for solving linear games over symmetric
+cones. The notion of a symmetric linear (cone) game was introduced by
+Gowda and Ravindran [GowdaRav]_, and extended by Orlitzky to
+asymmetric cones with two interior points.
 
 The state-of-the-art is that only symmetric games can be solved
 efficiently, and thus the linear games supported by Dunshire are a