X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=dunshire%2Fgames.py;h=71da5edbc561de3608e324c309c8ea3914213ce1;hb=019b62bedacc909118317f255725ff2891f161aa;hp=437b53336ab5791cbf010ff15aa5f78509ea57c0;hpb=e297d8d0471068f10d4953570047d6770ceeb7be;p=dunshire.git diff --git a/dunshire/games.py b/dunshire/games.py index 437b533..71da5ed 100644 --- a/dunshire/games.py +++ b/dunshire/games.py @@ -335,12 +335,12 @@ class SymmetricLinearGame: ' e1 = {:s},\n' \ ' e2 = {:s},\n' \ ' Condition((L, K, e1, e2)) = {:f}.' - indented_L = '\n '.join(str(self._L).splitlines()) - indented_e1 = '\n '.join(str(self._e1).splitlines()) - indented_e2 = '\n '.join(str(self._e2).splitlines()) + indented_L = '\n '.join(str(self.L()).splitlines()) + indented_e1 = '\n '.join(str(self.e1()).splitlines()) + indented_e2 = '\n '.join(str(self.e2()).splitlines()) return tpl.format(indented_L, - str(self._K), + str(self.K()), indented_e1, indented_e2, self.condition()) @@ -614,7 +614,7 @@ class SymmetricLinearGame: """ - return matrix([0, self._e2], (1, self.dimension() + 1), 'd') + return matrix([0, self.e2()], (1, self.dimension() + 1), 'd') @@ -657,7 +657,7 @@ class SymmetricLinearGame: """ identity_matrix = identity(self.dimension()) return append_row(append_col(self._zero(), -identity_matrix), - append_col(self._e1, -self._L)) + append_col(self.e1(), -self.L())) def _c(self): @@ -926,7 +926,7 @@ class SymmetricLinearGame: """ try: - opts = {'show_progress': options.VERBOSE} + opts = {'show_progress': False} soln_dict = solvers.conelp(self._c(), self._G(), self._h(), @@ -939,6 +939,7 @@ class SymmetricLinearGame: # Oops, CVXOPT tried to take the square root of a # negative number. Report some details about the game # rather than just the underlying CVXOPT crash. + printing.options['dformat'] = options.DEBUG_FLOAT_FORMAT raise PoorScalingException(self) else: raise error @@ -963,6 +964,7 @@ class SymmetricLinearGame: # that CVXOPT is convinced the problem is infeasible (and that # cannot happen). if soln_dict['status'] in ['primal infeasible', 'dual infeasible']: + printing.options['dformat'] = options.DEBUG_FLOAT_FORMAT raise GameUnsolvableException(self, soln_dict) # The "optimal" and "unknown" results, we actually treat the @@ -976,11 +978,13 @@ class SymmetricLinearGame: # it) because otherwise CVXOPT might return "unknown" and give # us two points in the cone that are nowhere near optimal. if abs(p1_value - p2_value) > 2*options.ABS_TOL: + printing.options['dformat'] = options.DEBUG_FLOAT_FORMAT raise GameUnsolvableException(self, soln_dict) # And we also check that the points it gave us belong to the # cone, just in case... if (p1_optimal not in self._K) or (p2_optimal not in self._K): + printing.options['dformat'] = options.DEBUG_FLOAT_FORMAT raise GameUnsolvableException(self, soln_dict) # For the game value, we could use any of: @@ -1068,10 +1072,10 @@ class SymmetricLinearGame: Condition((L, K, e1, e2)) = 44.476... """ - # We pass ``self._L`` right back into the constructor, because + # We pass ``self.L()`` right back into the constructor, because # it will be transposed there. And keep in mind that ``self._K`` # is its own dual. - return SymmetricLinearGame(self._L, - self._K, - self._e2, - self._e1) + return SymmetricLinearGame(self.L(), + self.K(), + self.e2(), + self.e1())