X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=doc%2Fsource%2Foverview.rst;h=95eb384f6069233747fa795fd18c4b0431c087d1;hb=HEAD;hp=d20cbe4d15bf23f71d684be97214af6b397235c5;hpb=a098e91f815fbe4b90dbe965262d7ff66cd5f2f7;p=dunshire.git

diff --git a/doc/source/overview.rst b/doc/source/overview.rst
index d20cbe4..95eb384 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
@@ -27,7 +27,7 @@ an :math:`\bar{x}` from
 and player two chooses a :math:`\bar{y}` from
 
 .. math::
-  \Delta_{2} &=
+  \Delta_{2} =
     \left\lbrace
       y \in K\ \middle|\ \left\langle y,e_{1} \right\rangle = 1
     \right\rbrace.