{"language":[{"iso":"eng"}],"publication":"Journal of Theoretical Biology","publication_status":"published","scopus_import":1,"_id":"2817","oa":1,"volume":334,"abstract":[{"text":"The basic idea of evolutionary game theory is that payoff determines reproductive rate. Successful individuals have a higher payoff and produce more offspring. But in evolutionary and ecological situations there is not only reproductive rate but also carrying capacity. Individuals may differ in their exposure to density limiting effects. Here we explore an alternative approach to evolutionary game theory by assuming that the payoff from the game determines the carrying capacity of individual phenotypes. Successful strategies are less affected by density limitation (crowding) and reach higher equilibrium abundance. We demonstrate similarities and differences between our framework and the standard replicator equation. Our equation is defined on the positive orthant, instead of the simplex, but has the same equilibrium points as the replicator equation. Linear stability analysis produces the classical conditions for asymptotic stability of pure strategies, but the stability properties of internal equilibria can differ in the two frameworks. For example, in a two-strategy game with an internal equilibrium that is always stable under the replicator equation, the corresponding equilibrium can be unstable in the new framework resulting in a limit cycle.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:49Z","date_created":"2018-12-11T11:59:45Z","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"publisher":"Elsevier","day":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_size":834604,"checksum":"3c29059ab03a4b8f97a07646b817ddbb","access_level":"open_access","date_created":"2018-12-12T10:14:54Z","date_updated":"2020-07-14T12:45:49Z","content_type":"application/pdf","file_name":"IST-2016-400-v1+1_1-s2.0-S0022519313002609-main.pdf","file_id":"5110","creator":"system"}],"ddc":["000"],"page":"26 - 34","doi":"10.1016/j.jtbi.2013.05.029","has_accepted_license":"1","type":"journal_article","date_updated":"2021-01-12T06:59:55Z","publist_id":"3984","oa_version":"Published Version","author":[{"first_name":"Sebastian","last_name":"Novak","full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"status":"public","license":"https://creativecommons.org/licenses/by/4.0/","year":"2013","pubrep_id":"400","ec_funded":1,"month":"10","date_published":"2013-10-07T00:00:00Z","citation":{"chicago":"Novak, Sebastian, Krishnendu Chatterjee, and Martin Nowak. “Density Games.” <i>Journal of Theoretical Biology</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.jtbi.2013.05.029\">https://doi.org/10.1016/j.jtbi.2013.05.029</a>.","ista":"Novak S, Chatterjee K, Nowak M. 2013. Density games. Journal of Theoretical Biology. 334, 26–34.","apa":"Novak, S., Chatterjee, K., &#38; Nowak, M. (2013). Density games. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2013.05.029\">https://doi.org/10.1016/j.jtbi.2013.05.029</a>","mla":"Novak, Sebastian, et al. “Density Games.” <i>Journal of Theoretical Biology</i>, vol. 334, Elsevier, 2013, pp. 26–34, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2013.05.029\">10.1016/j.jtbi.2013.05.029</a>.","short":"S. Novak, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 334 (2013) 26–34.","ama":"Novak S, Chatterjee K, Nowak M. Density games. <i>Journal of Theoretical Biology</i>. 2013;334:26-34. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2013.05.029\">10.1016/j.jtbi.2013.05.029</a>","ieee":"S. Novak, K. Chatterjee, and M. Nowak, “Density games,” <i>Journal of Theoretical Biology</i>, vol. 334. Elsevier, pp. 26–34, 2013."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"       334","project":[{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","title":"Density games"}