X-Git-Url: https://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=doc%2Fsource%2Foverview.rst;h=be857ae50559f0a3e7d0224ea1537a7a64f9c31e;hb=28bbeaaf75c62e88621e2c64919020904766f646;hp=98353b279826b1887c1798a43dd8b51f4f190ffd;hpb=8831e4cea810a6597770c0b1eabef52dad74928b;p=dunshire.git

diff --git a/doc/source/overview.rst b/doc/source/overview.rst
index 98353b2..be857ae 100644
--- a/doc/source/overview.rst
+++ b/doc/source/overview.rst
@@ -8,8 +8,8 @@ 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
-bastard of the two: the cones are symmetric, but the players get to
-choose two interior points.
+compromise between the two: the cones are symmetric, but the players
+get to choose two interior points.
 
 In this game, we have two players who are competing for a "payoff."
 There is a symmetric cone :math:`K`, a linear transformation :math:`L`