-
-
Notifications
You must be signed in to change notification settings - Fork 17
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
Independent Q-learning for BPD and Congestion Game #51
Conversation
…f results with original paper
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Mostly LGTM. Just a few comments. We might have to harmonize the plot style for the paper but that is quite simple.
momaland/learning/iql/iql.py
Outdated
cap_min, cap_max, mix_min, mix_max = self.g_cap_min, self.g_cap_max, self.g_mix_min, self.g_mix_max | ||
|
||
# Normalize the rewards | ||
cap_norm = (reward[0] - cap_min) / (cap_max - cap_min) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I believe we have a NormalizeReward wrapper made for this. Is it different?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The NormalizeReward wrapper normalizes the rewards that the agents receive directly. In the BDP environment, agents can be rewarded according to two reward schemes (local/global), but the reported results in the graphs are always using the (normalized) 'global' reward scheme regardless of what the agents receive. This method is primarily used to compute these normalized global rewards.
No description provided.