doc/source/overview.rst: delete errant ampersant.

[dunshire.git] / doc / source / overview.rst

diff --git a/doc/source/overview.rst b/doc/source/overview.rst
index be857ae50559f0a3e7d0224ea1537a7a64f9c31e..95eb384f6069233747fa795fd18c4b0431c087d1 100644 (file)
--- 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 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,17 +27,17 @@ 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.
 
 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 }