{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:22Z","timestamp":1740099622556,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030406158"},{"type":"electronic","value":"9783030406165"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-40616-5_32","type":"book-chapter","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T11:02:59Z","timestamp":1581591779000},"page":"370-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Generalizing Pure and Impure Iterated Prisoner\u2019s Dilemmas to the Case of Infinite and Infinitesimal Quantities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5413-0148","authenticated-orcid":false,"given":"Lorenzo","family":"Fiaschi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7020-1524","authenticated-orcid":false,"given":"Marco","family":"Cococcioni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,14]]},"reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1093\/bjps\/axw013","volume":"69","author":"V Benci","year":"2018","unstructured":"Benci, V., Horsten, L., Wenmackers, S.: Infinitesimal probabilities. Br. J. Philos. Sci. 69(2), 509\u2013552 (2018)","journal-title":"Br. J. Philos. Sci."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"105177","DOI":"10.1016\/j.cnsns.2020.105177","volume":"84","author":"M Cococcioni","year":"2020","unstructured":"Cococcioni, M., Cudazzo, A., Pappalardo, M., Sergeyev, Y.D.: Solving the lexicographic mixed-integer linear programming problem using Branch-and-Bound and Grossone methodology. Commun. Nonlinear Sci. Numer. Simul. 84, 105177 (2020). https:\/\/doi.org\/10.1016\/j.cnsns.2020.105177","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Cococcioni, M., Pappalardo, M., Sergeyev, Y.D.: Towards lexicographic multi-objective linear programming using grossone methodology. In: Sergeyev, Y.D., Kvasov, D., Dell\u2019Accio, F., Mukhametzhanov, M. (eds.) Proceedings of the 2nd International Conference \u201cNumerical Computations: Theory and Algorithms\u201d, vol. 1776, p. 090040. AIP Publishing, New York (2016)","DOI":"10.1063\/1.4965404"},{"key":"32_CR4","first-page":"298","volume":"318","author":"M Cococcioni","year":"2018","unstructured":"Cococcioni, M., Pappalardo, M., Sergeyev, Y.D.: Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm. Appl. Math. Comput. 318, 298\u2013311 (2018)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"32_CR5","first-page":"1","volume":"14","author":"L Fiaschi","year":"2018","unstructured":"Fiaschi, L., Cococcioni, M.: Numerical asymptotic results in game theory using sergeyev\u2019s infinity computing. Int. J. Unconv. Comput. 14(1), 1\u201325 (2018)","journal-title":"Int. J. Unconv. Comput."},{"key":"32_CR6","unstructured":"Fiaschi, L., Cococcioni, M.: Non-archimedean game theory: a numerical approach. Appl. Math. Comput. (submitted)"},{"key":"32_CR7","volume-title":"Game Theory","author":"D Fudenberg","year":"1991","unstructured":"Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)"},{"key":"32_CR8","volume-title":"Infinite Games with Perfect Information","author":"D Gale","year":"1953","unstructured":"Gale, D., Stewart, F.M.: Infinite Games with Perfect Information, vol. 2. Princeton University Press, Princeton (1953)"},{"issue":"Suppl. C","key":"32_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.geb.2015.05.005","volume":"92","author":"C Hilbe","year":"2015","unstructured":"Hilbe, C., Traulsen, A., Sigmund, K.: Partners or rivals? Strategies for the iterated prisoner\u2019s dilemma. Games Econ. Behav. 92(Suppl. C), 41\u201352 (2015)","journal-title":"Games Econ. Behav."},{"key":"32_CR10","unstructured":"Lai, L., Fiaschi, L., Cococcioni, M.: Solving mixed pareto-lexicographic multi-objective optimization problems: the case of priority chains (submitted)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1006\/jeth.1997.2328","volume":"77","author":"L Lambertini","year":"1997","unstructured":"Lambertini, L.: Prisoners\u2019 dilemma in duopoly (super) games. J. Econ. Theory 77, 181\u2013191 (1997)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01232420","volume":"69","author":"L Lambertini","year":"1999","unstructured":"Lambertini, L., Sasaki, D.: Optimal punishments in linear duopoly supergames with product differentiation. J. Econ. 69(2), 173\u2013188 (1999)","journal-title":"J. Econ."},{"issue":"3","key":"32_CR13","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1093\/philmat\/nkx035","volume":"26","author":"D Rizza","year":"2017","unstructured":"Rizza, D.: A study of mathematical determination through bertrand\u2019s paradox. Philos. Math. 26(3), 375\u2013395 (2017)","journal-title":"Philos. Math."},{"key":"32_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0073967","volume-title":"Toposes, Algebraic Geometry and Logic","author":"D Scott","year":"1972","unstructured":"Scott, D.: Continuous lattices. In: Lawvere, F.W. (ed.) Toposes, Algebraic Geometry and Logic. LNM, vol. 274, pp. 97\u2013136. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/BFb0073967"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.4171\/EMSS\/4-2-3","volume":"4","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev, Y.D.: Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems. EMS Surv. Math. Sci. 4, 219\u2013320 (2017)","journal-title":"EMS Surv. Math. Sci."},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10699-018-9566-y","volume":"24","author":"YD Sergeyev","year":"2019","unstructured":"Sergeyev, Y.D.: Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite. Found. Sci. 24, 153\u2013170 (2019)","journal-title":"Found. Sci."},{"issue":"1","key":"32_CR17","first-page":"3","volume":"12","author":"YD Sergeyev","year":"2016","unstructured":"Sergeyev, Y.D., Mukhametzhanov, M., Mazzia, F., Iavernaro, F., Amodio, P.: Numerical methods for solving initial value problems on the infinity computer. Int. J. Unconv. Comput. 12(1), 3\u201323 (2016)","journal-title":"Int. J. Unconv. Comput."},{"key":"32_CR18","unstructured":"Steven, K.: Prisoner\u2019s Dilemma. The Stanford Encyclopedia of Philosophy, Spring 2017. https:\/\/plato.stanford.edu\/archives\/spr2017\/entries\/prisoner-dilemma\/"},{"key":"32_CR19","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Topology via Logic","author":"S Vickers","year":"1989","unstructured":"Vickers, S.: Topology via Logic. Cambridge Tracts in Theoretical Computer Science, vol. 5. Cambridge University Press, Cambridge (1989)"},{"issue":"2","key":"32_CR20","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00500-014-1523-2","volume":"20","author":"W Zeng","year":"2016","unstructured":"Zeng, W., Li, M., Chen, F., Nan, G.: Risk consideration and cooperation in the iterated prisoner\u2019s dilemma. Soft. Comput. 20(2), 567\u2013587 (2016)","journal-title":"Soft. Comput."}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40616-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T08:23:24Z","timestamp":1614414204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-40616-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406158","9783030406165"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40616-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Crotone","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/si.deis.unical.it\/~yaro\/numta2019\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}