Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

FEAT: Create algorithm interface to eliminate dominated strategies from a game #346

Closed
Tracked by #341
tturocy opened this issue Sep 14, 2023 · 0 comments
Closed
Tracked by #341
Assignees

Comments

@tturocy
Copy link
Member

tturocy commented Sep 14, 2023

In parallel to how Nash-computing algorithms operate, we should package elimination of dominated strategies as an algorithm.

@tturocy tturocy self-assigned this Sep 14, 2023
tturocy added a commit that referenced this issue Sep 14, 2023
Previously, computing undominated strategies was done by a member function call on `StrategySupportProfile`. However, computing undominated strategies is a type of algorithm, and as such we are packaging it similarly to equilibrum-computation methods.

This closes #346.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant