Dynamic versus Instantaneous Models of Diet Choice
نویسندگان
چکیده
منابع مشابه
Dynamic versus instantaneous models of diet choice.
We investigate the dynamics of a series of two-prey-one-predator models in which the predator exhibits adaptive diet choice based on the different energy contents and/or handling times of the two prey species. The predator is efficient at exploiting its prey and has a saturating functional response; these two features combine to produce sustained population cycles over a wide range of parameter...
متن کاملstatic versus dynamic assessment of l2 learners’ reading ability
dynamic assessment according to vygotskys sociocultural theory, states that instruction and assessment are interrelated. using static forms of assessment with second and foreign language students could do more harm than good. many teachers neglect to take account of the complexity involved in learning a second or foreign language and often wonder why learning of a language take so long. thi...
Bayesian Estimation of Dynamic Discrete Choice Models
We propose a new estimator for dynamic programming discrete choice models. Our estimation method combines the Dynamic Programming algorithm with a Bayesian Markov Chain Monte Carlo algorithm into one single Markov Chain algorithm that solves the dynamic programming problem and estimates the parameters at the same time. Our key innovation is that during each solution-estimation iteration both th...
متن کاملIdentication of Structural Dynamic Discrete Choice Models
This paper presents new identi cation results for the class of structural dynamic discrete choice models that are built upon the framework of the structural discrete Markov decision processes proposed by Rust (1994). We demonstrate how to semiparametrically identify the deep structural parameters of interest in the case where utility function of one choice in the model is parametric but the dis...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Naturalist
سال: 2003
ISSN: 0003-0147,1537-5323
DOI: 10.1086/378783