From a098e91f815fbe4b90dbe965262d7ff66cd5f2f7 Mon Sep 17 00:00:00 2001 From: Michael Orlitzky Date: Tue, 15 Nov 2016 10:57:26 -0500 Subject: [PATCH] Reword two paragraphs in the overview. --- doc/source/overview.rst | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) 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 `_-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 } -- 2.43.2