Skip to content
This repository has been archived by the owner on Sep 6, 2024. It is now read-only.

Commit

Permalink
final(lab03): remove docstring
Browse files Browse the repository at this point in the history
  • Loading branch information
Alexey N. Alexandrov authored and Alexey N. Alexandrov committed Apr 9, 2024
1 parent d2fcdc4 commit d18e02e
Showing 1 changed file with 0 additions and 11 deletions.
11 changes: 0 additions & 11 deletions game_theory/utils/bimatrix_games/bimatrix.py
Original file line number Diff line number Diff line change
Expand Up @@ -123,17 +123,6 @@ def __is_pareto_optimal(self, first_index: IndexType, second_index: IndexType) -
for j in range(n)
)

"""
for i in range(self.bimatrix.shape[0]):
if self.bimatrix[i][second_index][0] >= self.bimatrix[first_index][second_index][0] and i != second_index:
return False
for j in range(self.bimatrix.shape[1]):
if self.bimatrix[first_index][j][1] >= self.bimatrix[first_index][second_index][1] and j != second_index:
return False
return True
"""

def __is_nash_optimal(self, first_index: IndexType, second_index: IndexType) -> bool:
"""Проверяет, является ли ситуация с данными индексами равновесной по Нэшу."""
m, n, _ = self.bimatrix.shape
Expand Down

0 comments on commit d18e02e

Please sign in to comment.