-
Notifications
You must be signed in to change notification settings - Fork 8
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
Recurring Conflict Complexity #11
Comments
Multiply LBD with RCC1: origin
2 generous guard: threshold * RCC.trend() < LBD.trend()
3 evacuater: threshold < LBD.trend() * RCC.trend()
|
RCC as var reward |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Objective
Restart if the present 'path' is a part of a too complex network. It's a derivation of #7.
Branches
I've learned so far
Tried
Since the development of path expansion isn't a Markov process, we can't estimate ... well, what?
The text was updated successfully, but these errors were encountered: