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

diff --git a/doc/source/overview.rst b/doc/source/overview.rst
index be857ae..d20cbe4 100644
--- a/doc/source/overview.rst
+++ b/doc/source/overview.rst
@@ -1,10 +1,10 @@
 Overview
 --------
 
-Dunshire is a `CVXOPT <http://cvxopt.org/>`_-based 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 (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.
 
 The state-of-the-art is that only symmetric games can be solved
 efficiently, and thus the linear games supported by Dunshire are a
@@ -34,10 +34,10 @@ and player two chooses a :math:`\bar{y}` from
 
 That ends the turn, and player one is paid :math:`\left\langle
 L\left(\bar{x}\right),\bar{y}\right\rangle` out of player two's
-pocket. As is usual to assume in game theory, we suppose that player
-one wants to maximize his worst-case payoff, and that player two wants
-to minimize his worst-case *payout*. In other words, player one wants
-to solve the optimization problem,
+pocket. As is usual in game theory, we suppose that player one wants
+to maximize his worst-case payoff, and that player two wants to
+minimize his worst-case *payout*. In other words, player one wants to
+solve the optimization problem,
 
 .. math::
   \text{find }