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

Confirm Reed S==D theorem, evaluate in Sethi context #20

Closed
cboettig opened this issue Jul 17, 2012 · 4 comments
Closed

Confirm Reed S==D theorem, evaluate in Sethi context #20

cboettig opened this issue Jul 17, 2012 · 4 comments

Comments

@cboettig
Copy link
Owner

Current results are not supporting S==D.

  1. Debug deterministic solution
  2. Compare in small-noise limit
  3. Compare impact of harvesting cost on S vs D (linear cost, no cost, quadratic costs)
  4. Compare in Sethi noise cases
@cboettig
Copy link
Owner Author

See Reed vs Clark comparison. Not confirming S==D:

+plot of chunk policyfn_plot

@cboettig
Copy link
Owner Author

This occurs because Reed enforces the population to only increase, absent fishing (regardless of the shock). If we replace f(x) with x+f(x), we should recover the Reed result.

@cboettig
Copy link
Owner Author

Changing the growth noise to only allow increasing population fixes this, confirming the Reed D==S.
diff

plot of chunk policyfn_plot

@cboettig
Copy link
Owner Author

cboettig commented Aug 3, 2012

So the self-sustaining condition requires that min(Z_t) > x/f(x), which sets the smallest permissible multiplicative shock at x == D, the escapement level. Roughly speaking, are large shock sizes are just over this in the uniform noise case, and clearly log-normal noise cannot satisfy this since x/f(x) > 0 everywhere. More discussion in the lab notebook: http://www.carlboettiger.info/2012/07/30/notes.html

@cboettig cboettig closed this as completed Aug 3, 2012
@ghost ghost assigned cboettig Sep 23, 2012
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant