{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T05:41:36Z","timestamp":1741066896949,"version":"3.38.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T00:00:00Z","timestamp":1722211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T00:00:00Z","timestamp":1722211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"STIC AMSUD","award":["22-STIC-09"],"award-info":[{"award-number":["22-STIC-09"]}]},{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["FONDECYT 11200616"],"award-info":[{"award-number":["FONDECYT 11200616"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institut de valorisation des donn\u00e9es (IVADO) and Fonds de recherche du Qu\u00e9bec","award":["FRQ-IVADO Research Chair, NSERC grant 2019-04557"],"award-info":[{"award-number":["FRQ-IVADO Research Chair, NSERC grant 2019-04557"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s13235-024-00582-7","type":"journal-article","created":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T10:02:56Z","timestamp":1722247376000},"page":"306-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Integration of Sales and Operations: A Dynamic Mixed-Integer Programming Game"],"prefix":"10.1007","volume":"15","author":[{"given":"Claudio","family":"Telha","sequence":"first","affiliation":[]},{"given":"Margarida","family":"Carvalho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,29]]},"reference":[{"issue":"1","key":"582_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10479-014-1784-2","volume":"257","author":"PC Bell","year":"2017","unstructured":"Bell PC, Chen J (2017) Close integration of pricing and supply chain decisions has strategic as well as operations level benefits. Ann Oper Res 257(1):77\u201393. https:\/\/doi.org\/10.1007\/s10479-014-1784-2","journal-title":"Ann Oper Res"},{"issue":"6","key":"582_CR2","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1287\/opre.1110.0964","volume":"59","author":"M K\u00f6ppe","year":"2011","unstructured":"K\u00f6ppe M, Ryan CT, Queyranne M (2011) Rational generating functions and integer programming games. Oper Res 59(6):1445\u20131460. https:\/\/doi.org\/10.1287\/opre.1110.0964","journal-title":"Oper Res"},{"issue":"3","key":"582_CR3","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.ejor.2022.03.048","volume":"303","author":"M Carvalho","year":"2022","unstructured":"Carvalho M, Lodi A, Pedroso JP (2022) Computing equilibria for integer programming games. Eur J Oper Res 303(3):1057\u20131070. https:\/\/doi.org\/10.1016\/j.ejor.2022.03.048","journal-title":"Eur J Oper Res"},{"key":"582_CR4","doi-asserted-by":"crossref","unstructured":"Carvalho M, Dragotto G, Lodi A, Sankaranarayan S (2023) Integer programming games: a gentle computational overview. arXiv preprint arXiv:2306.02817","DOI":"10.1287\/educ.2023.0260"},{"key":"582_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/8442","volume-title":"Games and dynamic games","author":"A Haurie","year":"2012","unstructured":"Haurie A, Krawczyk JB, Zaccour G (2012) Games and dynamic games, vol 1. World Scientific Publishing Company, Singapore"},{"key":"582_CR6","volume-title":"Production planning by mixed integer programming. Springer series in operations research and financial engineering","author":"Y Pochet","year":"2006","unstructured":"Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer series in operations research and financial engineering. Springer, Berlin"},{"issue":"1","key":"582_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10107-004-0521-z","volume":"108","author":"M Van Vyve","year":"2006","unstructured":"Van Vyve M (2006) Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity. Math Program 108(1):53\u201377. https:\/\/doi.org\/10.1007\/s10107-004-0521-z","journal-title":"Math Program"},{"issue":"3","key":"582_CR8","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1287\/moor.1070.0257","volume":"32","author":"M Van Vyve","year":"2007","unstructured":"Van Vyve M (2007) Algorithms for single-item lot-sizing problems with constant batch size. Math Oper Res 32(3):594\u2013613. https:\/\/doi.org\/10.1287\/moor.1070.0257","journal-title":"Math Oper Res"},{"issue":"10","key":"582_CR9","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1287\/mnsc.44.10.1409","volume":"44","author":"F Vanderbeck","year":"1998","unstructured":"Vanderbeck F (1998) Lot-sizing with start-up times. Manag Sci 44(10):1409\u20131425. https:\/\/doi.org\/10.1287\/mnsc.44.10.1409","journal-title":"Manag Sci"},{"issue":"1","key":"582_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10107-007-0202-9","volume":"119","author":"S Anily","year":"2009","unstructured":"Anily S, Tzur M, Wolsey LA (2009) Multi-item lot-sizing with joint set-up costs. Math Program 119(1):79\u201394. https:\/\/doi.org\/10.1007\/s10107-007-0202-9","journal-title":"Math Program"},{"issue":"1","key":"582_CR11","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ijpe.2008.08.033","volume":"118","author":"A Kov\u00e1cs","year":"2009","unstructured":"Kov\u00e1cs A, Brown KN, Tarim SA (2009) An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups. Int J Prod Econ 118(1):282\u2013291. https:\/\/doi.org\/10.1016\/j.ijpe.2008.08.033","journal-title":"Int J Prod Econ"},{"issue":"2","key":"582_CR12","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ijpe.2011.05.017","volume":"133","author":"I Okhrin","year":"2011","unstructured":"Okhrin I, Richter K (2011) The linear dynamic lot size problem with minimum order quantity. Int J Prod Econ 133(2):688\u2013693. https:\/\/doi.org\/10.1016\/j.ijpe.2011.05.017","journal-title":"Int J Prod Econ"},{"issue":"10","key":"582_CR13","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","volume":"30","author":"I Barany","year":"1984","unstructured":"Barany I, Van Roy TJ, Wolsey LA (1984) Strong formulations for multi-item capacitated lot sizing. Manag Sci 30(10):1255\u20131261. https:\/\/doi.org\/10.1287\/mnsc.30.10.1255","journal-title":"Manag Sci"},{"issue":"3","key":"582_CR14","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1287\/mnsc.34.3.420","volume":"34","author":"C-S Chung","year":"1988","unstructured":"Chung C-S, Lin C-HM (1988) An $${O(T^2)}$$ algorithm for the $${NI\/G\/NI\/ND}$$ capacitated lot size problem. Manag Sci 34(3):420\u2013426. https:\/\/doi.org\/10.1287\/mnsc.34.3.420","journal-title":"Manag Sci"},{"issue":"4","key":"582_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1287\/opre.51.4.557.16094","volume":"51","author":"AJ Miller","year":"2003","unstructured":"Miller AJ, Wolsey LA (2003) Tight MIP formulation for multi-item discrete lot-sizing problems. Oper Res 51(4):557\u2013565. https:\/\/doi.org\/10.1287\/opre.51.4.557.16094","journal-title":"Oper Res"},{"issue":"5","key":"582_CR16","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1287\/opre.1060.0325","volume":"54","author":"N Brahimi","year":"2006","unstructured":"Brahimi N, Dauz\u00e8re-P\u00e9r\u00e8s S, Najid NM (2006) Capacitated multi-item lot-sizing problems with time windows. Oper Res 54(5):951\u2013967. https:\/\/doi.org\/10.1287\/opre.1060.0325","journal-title":"Oper Res"},{"issue":"1\u20132","key":"582_CR17","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-013-0702-8","volume":"146","author":"M Van Vyve","year":"2014","unstructured":"Van Vyve M, Wolsey LA, Yaman H (2014) Relaxations for two-level multi-item lot-sizing problems. Math Program 146(1\u20132):495\u2013523. https:\/\/doi.org\/10.1007\/s10107-013-0702-8","journal-title":"Math Program"},{"issue":"1","key":"582_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1287\/mnsc.13.1.105","volume":"13","author":"WI Zangwill","year":"1966","unstructured":"Zangwill WI (1966) A deterministic multi-period production scheduling model with backlogging. Manag Sci 13(1):105\u2013119. https:\/\/doi.org\/10.1287\/mnsc.13.1.105","journal-title":"Manag Sci"},{"issue":"2","key":"582_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0305-0548(87)90007-4","volume":"14","author":"CS Sung","year":"1987","unstructured":"Sung CS, Rhee JT (1987) A dynamic production scheduling model with lost-sales or backlogging. Comput Oper Res 14(2):163\u2013171. https:\/\/doi.org\/10.1016\/0305-0548(87)90007-4","journal-title":"Comput Oper Res"},{"key":"582_CR20","doi-asserted-by":"publisher","unstructured":"Federgruen A, Tzur M (1993) The dynamic lot-sizing model with backlogging: a simple $${o(n \\log (n))}$$ algorithm and minimal forecast horizon procedure. Nav Res Logist 40(4):459\u2013478. https:\/\/doi.org\/10.1002\/1520-6750(199306)40:4<459::AID-NAV3220400404>3.0.CO;2-8","DOI":"10.1002\/1520-6750(199306)40:4<459::AID-NAV3220400404>3.0.CO;2-8"},{"issue":"2","key":"582_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0167-6377(99)00030-9","volume":"25","author":"A Agra","year":"1999","unstructured":"Agra A, Constantino M (1999) Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs. Oper Res Lett 25(2):81\u201388. https:\/\/doi.org\/10.1016\/S0167-6377(99)00030-9","journal-title":"Oper Res Lett"},{"issue":"3","key":"582_CR22","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/S0377-2217(02)00331-4","volume":"147","author":"D Aksen","year":"2003","unstructured":"Aksen D, Alt\u0131nkemer K, Chand S (2003) The single-item lot-sizing problem with immediate lost sales. Eur J Oper Res 147(3):558\u2013566. https:\/\/doi.org\/10.1016\/S0377-2217(02)00331-4","journal-title":"Eur J Oper Res"},{"issue":"2","key":"582_CR23","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ijpe.2009.03.010","volume":"119","author":"A Akbalik","year":"2009","unstructured":"Akbalik A, Penz B (2009) Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs. Int J Prod Econ 119(2):367\u2013379. https:\/\/doi.org\/10.1016\/j.ijpe.2009.03.010","journal-title":"Int J Prod Econ"},{"issue":"7","key":"582_CR24","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1287\/mnsc.47.7.993.9800","volume":"47","author":"G Belvaux","year":"2001","unstructured":"Belvaux G, Wolsey LA (2001) Modelling practical lot-sizing problems as mixed-integer programs. Manag Sci 47(7):993\u20131007. https:\/\/doi.org\/10.1287\/mnsc.47.7.993.9800","journal-title":"Manag Sci"},{"key":"582_CR25","doi-asserted-by":"publisher","unstructured":"Eliashberg J, Steinberg R (1993) Chapter 18 Marketing-production joint decision-making, vol 5, pp 827\u2013880. Elsevier. https:\/\/doi.org\/10.1016\/S0927-0507(05)80041-6. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0927050705800416","DOI":"10.1016\/S0927-0507(05)80041-6"},{"issue":"11","key":"582_CR26","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1287\/mnsc.16.11.747","volume":"16","author":"J Thomas","year":"1970","unstructured":"Thomas J (1970) Price-production decisions with deterministic demand. Manag Sci 16(11):747\u2013750. https:\/\/doi.org\/10.1287\/mnsc.16.11.747","journal-title":"Manag Sci"},{"key":"582_CR27","doi-asserted-by":"publisher","unstructured":"Yano CA, Gilbert SM (2005). In: Chakravarty AK, Eliashberg J (eds) Coordinated pricing and production\/procurement decisions: a review. International series in quantitative marketing, vol 16, pp 65\u2013103. Springer. https:\/\/doi.org\/10.1007\/0-387-25002-6_3","DOI":"10.1007\/0-387-25002-6_3"},{"issue":"2","key":"582_CR28","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/mnsc.39.2.191","volume":"39","author":"AG Sogomonian","year":"1993","unstructured":"Sogomonian AG, Tang CS (1993) A modeling framework for coordinating promotion and production decisions within a firm. Manag Sci 39(2):191\u2013203. https:\/\/doi.org\/10.1287\/mnsc.39.2.191","journal-title":"Manag Sci"},{"key":"582_CR29","doi-asserted-by":"publisher","unstructured":"Upasani A, Uzsoy R (2014). In: Pulat PS, Sarin SC, Uzsoy R (eds) Integrated production planning and pricing decisions in congestion-prone capacitated production systems. International series in operations research & management science, vol 200, pp 29\u201368. Springer. https:\/\/doi.org\/10.1007\/978-1-4614-9056-2_3","DOI":"10.1007\/978-1-4614-9056-2_3"},{"issue":"3","key":"582_CR30","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1111\/j.1937-5956.2002.tb00193.x","volume":"11","author":"S Chatterjee","year":"2009","unstructured":"Chatterjee S, Slotnick SA, Sobel MJ (2009) Delivery guarantees and the interdependence of marketing and operations. Prod Oper Manag 11(3):393\u2013410. https:\/\/doi.org\/10.1111\/j.1937-5956.2002.tb00193.x","journal-title":"Prod Oper Manag"},{"key":"582_CR31","doi-asserted-by":"publisher","unstructured":"Keskinocak P, Tayur S (2004). In: Simchi-Levi D, Wu SD, Shen Z-J (eds) Due date management policies. International series in operations research & management science, vol 74, pp 485\u2013554. Springer. https:\/\/doi.org\/10.1007\/978-1-4020-7953-5_12","DOI":"10.1007\/978-1-4020-7953-5_12"},{"issue":"1","key":"582_CR32","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10479-007-0294-x","volume":"161","author":"A Upasani","year":"2008","unstructured":"Upasani A, Uzsoy R (2008) Incorporating manufacturing lead times in joint production-marketing models: a review and some future directions. Ann Oper Res 161(1):171\u2013188. https:\/\/doi.org\/10.1007\/s10479-007-0294-x","journal-title":"Ann Oper Res"},{"issue":"3","key":"582_CR33","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1287\/opre.47.3.454","volume":"47","author":"A Federgruen","year":"1999","unstructured":"Federgruen A, Heching A (1999) Combined pricing and inventory control under uncertainty. Oper Res 47(3):454\u2013475. https:\/\/doi.org\/10.1287\/opre.47.3.454","journal-title":"Oper Res"},{"issue":"3","key":"582_CR34","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/nav.3800220306","volume":"22","author":"GT Thowsen","year":"1975","unstructured":"Thowsen GT (1975) A dynamic, nonstationary inventory problem for a price\/quantity setting firm. Nav Res Logist Q 22(3):461\u2013476. https:\/\/doi.org\/10.1002\/nav.3800220306","journal-title":"Nav Res Logist Q"},{"issue":"2","key":"582_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02579075","volume":"9","author":"P Borm","year":"2001","unstructured":"Borm P, Hamers H, Hendrickx R (2001) Operations research games: a survey. Top 9(2):139\u2013199. https:\/\/doi.org\/10.1007\/BF02579075","journal-title":"Top"},{"issue":"1","key":"582_CR36","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0377-2217(98)00310-5","volume":"118","author":"H Hamers","year":"1999","unstructured":"Hamers H, Borm P, Leensel R, Tijs S (1999) Cost allocation in the Chinese postman problem. Eur J Oper Res 118(1):153\u2013163. https:\/\/doi.org\/10.1016\/S0377-2217(98)00310-5","journal-title":"Eur J Oper Res"},{"issue":"1","key":"582_CR37","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.jet.2006.11.001","volume":"137","author":"G Berganti\u00f1os","year":"2007","unstructured":"Berganti\u00f1os G, Vidal-Puga JJ (2007) A fair rule in minimum cost spanning tree problems. J Econ Theory 137(1):326\u2013352. https:\/\/doi.org\/10.1016\/j.jet.2006.11.001","journal-title":"J Econ Theory"},{"key":"582_CR38","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.dam.2014.07.021","volume":"179","author":"D Granot","year":"2014","unstructured":"Granot D, Granot F, Ravichandran H (2014) The k-centrum Chinese postman delivery problem and a related cost allocation game. Discret Appl Math 179:100\u2013108. https:\/\/doi.org\/10.1016\/j.dam.2014.07.021","journal-title":"Discret Appl Math"},{"issue":"1","key":"582_CR39","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley LS, Shubik M (1971) The assignment game I: the core. Int J Game Theory 1(1):111\u2013130. https:\/\/doi.org\/10.1007\/BF01753437","journal-title":"Int J Game Theory"},{"key":"582_CR40","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.trb.2019.04.008","volume":"124","author":"S Rasulkhani","year":"2019","unstructured":"Rasulkhani S, Chow JYJ (2019) Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game. Transp Res Part B Method 124:60\u201381. https:\/\/doi.org\/10.1016\/j.trb.2019.04.008","journal-title":"Transp Res Part B Method"},{"issue":"1","key":"582_CR41","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.geb.2007.02.003","volume":"65","author":"LA Guardiola","year":"2009","unstructured":"Guardiola LA, Meca A, Puerto J (2009) Production-inventory games: a new class of totally balanced combinatorial optimization games. Games Econ Behav 65(1):205\u2013219. https:\/\/doi.org\/10.1016\/j.geb.2007.02.003","journal-title":"Games Econ Behav"},{"issue":"1","key":"582_CR42","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0377-2217(02)00913-X","volume":"156","author":"A Meca","year":"2004","unstructured":"Meca A (2004) Inventory games. Eur J Oper Res 156(1):127\u2013139. https:\/\/doi.org\/10.1016\/S0377-2217(02)00913-X","journal-title":"Eur J Oper Res"},{"key":"582_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13725-9","volume-title":"Cooperative lot sizing games in supply chains. Lecture notes in economics and mathematical systems","author":"J Drechsel","year":"2010","unstructured":"Drechsel J (2010) Cooperative lot sizing games in supply chains. Lecture notes in economics and mathematical systems, vol 644. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-13725-9"},{"issue":"2","key":"582_CR44","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1016\/j.ejor.2005.09.011","volume":"176","author":"H Wvd","year":"2007","unstructured":"Wvd H, Borm P, Hamers H (2007) Economic lot-sizing games. Eur J Oper Res 176(2):1117\u20131130. https:\/\/doi.org\/10.1016\/j.ejor.2005.09.011","journal-title":"Eur J Oper Res"},{"issue":"1","key":"582_CR45","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/nav.20321","volume":"56","author":"A Federgruen","year":"2009","unstructured":"Federgruen A, Meissner J (2009) Competition under time-varying demands and dynamic lot sizing costs. Nav Res Logist 56(1):57\u201373. https:\/\/doi.org\/10.1002\/nav.20321","journal-title":"Nav Res Logist"},{"issue":"3","key":"582_CR46","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1287\/opre.2015.1380","volume":"63","author":"A Federgruen","year":"2015","unstructured":"Federgruen A, Hu M (2015) Multi-product price and assortment competition. Oper Res 63(3):572\u2013584. https:\/\/doi.org\/10.1287\/opre.2015.1380","journal-title":"Oper Res"},{"key":"582_CR47","unstructured":"Pedroso JP, Smeers Y (2014) Equilibria on a game with discrete variables. arXiv:1407.8394 [cs]"},{"key":"582_CR48","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ijpe.2018.07.026","volume":"204","author":"M Carvalho","year":"2018","unstructured":"Carvalho M, Pedroso JP, Telha C, Van Vyve M (2018) Competitive uncapacitated lot-sizing game. Int J Prod Econ 204:148\u2013159. https:\/\/doi.org\/10.1016\/j.ijpe.2018.07.026","journal-title":"Int J Prod Econ"},{"issue":"3","key":"582_CR49","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.ejor.2017.10.026","volume":"266","author":"A Lamas","year":"2018","unstructured":"Lamas A, Chevalier P (2018) Joint dynamic pricing and lot-sizing under competition. Eur J Oper Res 266(3):864\u2013876. https:\/\/doi.org\/10.1016\/j.ejor.2017.10.026","journal-title":"Eur J Oper Res"},{"key":"582_CR50","doi-asserted-by":"crossref","unstructured":"Carvalho M, Lodi A, Pedroso JP (2017) Existence of Nash equilibria on integer programming games","DOI":"10.1007\/978-3-319-71583-4_2"},{"issue":"1","key":"582_CR51","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TPWRS.2004.840397","volume":"20","author":"MV Pereira","year":"2005","unstructured":"Pereira MV, Granville S, Fampa MHC, Dix R, Barroso LA (2005) Strategic bidding under uncertainty: a binary expansion approach. IEEE Trans Power Syst 20(1):180\u2013188. https:\/\/doi.org\/10.1109\/TPWRS.2004.840397","journal-title":"IEEE Trans Power Syst"},{"issue":"1\u20132","key":"582_CR52","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10107-016-1013-7","volume":"161","author":"M Carvalho","year":"2017","unstructured":"Carvalho M, Lodi A, Pedroso JP, Viana A (2017) Nash equilibria in the two-player kidney exchange game. Math Program 161(1\u20132):389\u2013417. https:\/\/doi.org\/10.1007\/s10107-016-1013-7","journal-title":"Math Program"},{"issue":"2","key":"582_CR53","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ijpe.2011.01.022","volume":"131","author":"H Li","year":"2011","unstructured":"Li H, Meissner J (2011) Competition under capacitated dynamic lot-sizing with capacity acquisition. Int J Prod Econ 131(2):535\u2013544. https:\/\/doi.org\/10.1016\/j.ijpe.2011.01.022","journal-title":"Int J Prod Econ"},{"key":"582_CR54","doi-asserted-by":"publisher","unstructured":"Carvalho M, Dragotto G, Lodi A, Sankaranarayanan S (2021) The cut and play algorithm: computing Nash equilibria via outer approximations. arXiv. https:\/\/doi.org\/10.48550\/ARXIV.2111.05726","DOI":"10.48550\/ARXIV.2111.05726"},{"issue":"2","key":"582_CR55","first-page":"301","volume":"121","author":"R Selten","year":"1965","unstructured":"Selten R (1965) Spieltheoretische behandlung eines oligopolmodells mit nachfragetr\u00e4gheit: Teil i: Bestimmung des dynamischen preisgleichgewichts. Zeitschrift f\u00fcr die gesamte Staatswissenschaft\/J Inst Theor Econ 121(2):301\u2013324","journal-title":"Zeitschrift f\u00fcr die gesamte Staatswissenschaft\/J Inst Theor Econ"},{"issue":"1","key":"582_CR56","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01254386","volume":"25","author":"D Koller","year":"1996","unstructured":"Koller D, Megiddo N (1996) Finding mixed strategies with small supports in extensive form games. Int J Game Theory 25(1):73\u201392","journal-title":"Int J Game Theory"},{"issue":"2","key":"582_CR57","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1006\/game.1996.0050","volume":"14","author":"B von Stengel","year":"1996","unstructured":"von Stengel B (1996) Efficient computation of behavior strategies. Games Econ Behav 14(2):220\u2013246. https:\/\/doi.org\/10.1006\/game.1996.0050","journal-title":"Games Econ Behav"},{"key":"582_CR58","doi-asserted-by":"publisher","unstructured":"De Giovanni P, Zaccour G (2022) A survey of dynamic models of product quality. Eur J Oper Res 307(3):991\u20131007. https:\/\/doi.org\/10.1016\/j.ejor.2022.06.010","DOI":"10.1016\/j.ejor.2022.06.010"},{"key":"582_CR59","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-9149-1","volume-title":"The logic of logistics: theory, algorithms, and applications for logistics management. Springer series in operations research and financial engineering","author":"D Simchi-Levi","year":"2014","unstructured":"Simchi-Levi D, Chen X, Bramel J (2014) The logic of logistics: theory, algorithms, and applications for logistics management. Springer series in operations research and financial engineering, 3rd edn. Springer, Berlin","edition":"3"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-024-00582-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13235-024-00582-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-024-00582-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T13:51:09Z","timestamp":1741009869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13235-024-00582-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,29]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["582"],"URL":"https:\/\/doi.org\/10.1007\/s13235-024-00582-7","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"type":"print","value":"2153-0785"},{"type":"electronic","value":"2153-0793"}],"subject":[],"published":{"date-parts":[[2024,7,29]]},"assertion":[{"value":"16 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The second author is an associate editor of dynamic games and applications.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}