{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T04:16:19Z","timestamp":1770524179486,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-2020-06488"],"award-info":[{"award-number":["RGPIN-2020-06488"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10107-024-02126-8","type":"journal-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T06:03:01Z","timestamp":1723096981000},"page":"335-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing for strategy diversity in the design of video games"],"prefix":"10.1007","volume":"210","author":[{"given":"Oussama","family":"Hanguir","sequence":"first","affiliation":[]},{"given":"Will","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Jiangze","family":"Han","sequence":"additional","affiliation":[]},{"given":"Christopher Thomas","family":"Ryan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,8]]},"reference":[{"key":"2126_CR1","doi-asserted-by":"crossref","unstructured":"Hanguir, O., Ma, W., Ryan, C.T.: Designing optimization problems with diverse solutions. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 172\u2013186. Springer (2023)","DOI":"10.1007\/978-3-031-32726-1_13"},{"key":"2126_CR2","unstructured":"Schoenau-Fog, H. et al.: The player engagement process\u2014an exploration of continuation desire in digital games. In: DiGRA Conference (2011)"},{"key":"2126_CR3","unstructured":"Knight, V.: Maths behind a MOBA: Using Linear Programming to model and solve a problem. https:\/\/vknight.org\/Computing_for_mathematics\/Assessment\/IndividualCoursework\/PastCourseWorks\/2015-2016\/knight2015-2016.pdf (2015)"},{"key":"2126_CR4","unstructured":"Knight, V.: Wizards, Giants, Linear Programming and Sage. http:\/\/drvinceknight.blogspot.com\/2014\/05\/wizards-giants-linear-programming-and.html (2014)"},{"key":"2126_CR5","unstructured":"Tozour, P.: Decision Modeling and Optimization in Game Design, Part 1: Introduction. https:\/\/www.gamasutra.com\/blogs\/PaulTozour\/20130707\/195718\/Decision_Modeling_and_Optimization_in_Game_Design_Part_1_Introduction.php (2013)"},{"issue":"3","key":"2126_CR6","first-page":"316","volume":"2","author":"T Saaty","year":"1954","unstructured":"Saaty, T., Gass, S.: Parametric objective function (part 1). J. Oper. Res. Soc. Am. 2(3), 316\u2013319 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"key":"2126_CR7","first-page":"183","volume-title":"Linear Inequalities and Related Systems","author":"H Mills","year":"1956","unstructured":"Mills, H.: Marginal values of matrix games and linear programs. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems, pp. 183\u2013194. Princeton University Press, Princeton (1956)"},{"issue":"1","key":"2126_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/0111006","volume":"11","author":"A Williams","year":"1963","unstructured":"Williams, A.: Marginal values in linear programming. J. Soc. Ind. Appl. Math. 11(1), 82\u201394 (1963)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"2126_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.2140\/pjm.1969.28.465","volume":"28","author":"D Walkup","year":"1969","unstructured":"Walkup, D., Wets, R.: Lifting projections of convex polyhedra. Pac. J. Math. 28(2), 465\u2013475 (1969)","journal-title":"Pac. J. Math."},{"issue":"2","key":"2126_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.ejor.2020.07.053","volume":"289","author":"F Parre\u00f1o","year":"2021","unstructured":"Parre\u00f1o, F., \u00c1lvarez-Vald\u00e9s, R., Mart\u00ed, R.: Measuring diversity: a review and an empirical analysis. Eur. J. Oper. Res. 289(2), 515\u2013532 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2126_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.1100.0852","volume":"59","author":"J Turner","year":"2011","unstructured":"Turner, J., Scheller-Wolf, A., Tayur, S.: Scheduling of dynamic in-game advertising. Oper. Res. 59(1), 1\u201316 (2011)","journal-title":"Oper. Res."},{"issue":"10","key":"2126_CR12","doi-asserted-by":"publisher","first-page":"2413","DOI":"10.1111\/poms.13015","volume":"28","author":"H Guo","year":"2019","unstructured":"Guo, H., Zhao, X., Hao, L., Liu, D.: Economic analysis of reward advertising. Prod. Oper. Manag. 28(10), 2413\u20132430 (2019)","journal-title":"Prod. Oper. Manag."},{"key":"2126_CR13","unstructured":"Sheng, L., Ryan, C.T., Nagarajan, M., Cheng, Y., Tong, C.: Incentivized actions in freemium games. Manuf. Serv. Oper. Manag. (2020)"},{"issue":"2","key":"2126_CR14","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/isre.2018.0812","volume":"30","author":"H Guo","year":"2019","unstructured":"Guo, H., Hao, L., Mukhopadhyay, T., Sun, D.: Selling virtual currency in digital games: implications for gameplay and social welfare. Inf. Syst. Res. 30(2), 430\u2013446 (2019)","journal-title":"Inf. Syst. Res."},{"issue":"8","key":"2126_CR15","doi-asserted-by":"publisher","first-page":"4809","DOI":"10.1287\/mnsc.2020.3748","volume":"67","author":"N Chen","year":"2020","unstructured":"Chen, N., Elmachtoub, A.N., Hamilton, M.L., Lei, X.: Loot box pricing and design. Manag. Sci. 67(8), 4809\u20134825 (2020)","journal-title":"Manag. Sci."},{"key":"2126_CR16","unstructured":"Ryan, C.T., Sheng, L., Zhao, X.: Selling enhanced attempts. Available at SSRN 3751523 (2020)"},{"key":"2126_CR17","doi-asserted-by":"crossref","unstructured":"Chen, Z., Xue, S., Kolen, J., Aghdaie, N., Zaman, K.A., Sun, Y., Seif\u00a0El-Nasr, M.: EOMM: An engagement optimized matchmaking framework. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1143\u20131150 (2017)","DOI":"10.1145\/3038912.3052559"},{"issue":"3","key":"2126_CR18","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1287\/isre.2019.0839","volume":"30","author":"Y Huang","year":"2019","unstructured":"Huang, Y., Jasin, S., Manchanda, P.: \u201cLevel up\u2019\u2019: Leveraging skill and engagement to maximize player game-play in online video games. Inf. Syst. Res. 30(3), 927\u2013947 (2019)","journal-title":"Inf. Syst. Res."},{"issue":"2","key":"2126_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17(2), 179\u2013184 (1970)","journal-title":"Mathematika"},{"key":"2126_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-12971-1","volume-title":"Triangulations: Structures for Algorithms and Applications","author":"J De Loera","year":"2010","unstructured":"De Loera, J., Rambau, J., Santos, F.: Triangulations: Structures for Algorithms and Applications, vol. 25. Springer, Heidelberg (2010)"},{"issue":"2","key":"2126_CR21","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02614622","volume":"77","author":"B Sturmfels","year":"1997","unstructured":"Sturmfels, B., Thomas, R.R.: Variation of cost functions in integer programming. Math. Program. 77(2), 357\u2013387 (1997)","journal-title":"Math. Program."},{"key":"2126_CR22","volume-title":"Lectures on Convex Sets","author":"V Soltan","year":"2019","unstructured":"Soltan, V.: Lectures on Convex Sets, vol. 986. World Scientific, Hackensack (2019)"},{"key":"2126_CR23","volume-title":"Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra","author":"M Beck","year":"2007","unstructured":"Beck, M., Robins, S.: Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra. Springer, Heidelberg (2007)"},{"issue":"1","key":"2126_CR24","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01405094","volume":"88","author":"G Kalai","year":"1987","unstructured":"Kalai, G.: Rigidity and the lower bound theorem 1. Invent. Math. 88(1), 125\u2013151 (1987)","journal-title":"Invent. Math."},{"issue":"1","key":"2126_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.37236\/319","volume":"17","author":"S-P Eu","year":"2010","unstructured":"Eu, S.-P., Fu, T.-S., Pan, Y.-J.: The cyclic sieving phenomenon for faces of cyclic polytopes. Electron. J. Comb. 17(1), 47 (2010)","journal-title":"Electron. J. Comb."},{"issue":"4","key":"2126_CR26","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF02771216","volume":"6","author":"GC Shephard","year":"1968","unstructured":"Shephard, G.C.: A theorem on cyclic polytopes. Isr. J. Math. 6(4), 368\u2013372 (1968)","journal-title":"Isr. J. Math."},{"issue":"4","key":"2126_CR27","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1287\/moor.1080.0320","volume":"33","author":"F Eisenbrand","year":"2008","unstructured":"Eisenbrand, F., Shmonin, G.: Parametric integer programming in fixed dimension. Math. Oper. Res. 33(4), 839\u2013850 (2008)","journal-title":"Math. Oper. Res."},{"key":"2126_CR28","doi-asserted-by":"crossref","unstructured":"Gribanov, D., Shumilov, I., Malyshev, D., Pardalos, P.: On $$\\delta $$-modular integer linear problems in the canonical form and equivalent problems. J. Glob. Optim. 1\u201361 (2022)","DOI":"10.1007\/s10898-022-01165-9"},{"issue":"3","key":"2126_CR29","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF00939554","volume":"56","author":"T Tanino","year":"1988","unstructured":"Tanino, T.: Sensitivity analysis in multiobjective optimization. J. Optim. Theory Appl. 56(3), 479\u2013499 (1988)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2126_CR30","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF03015009","volume":"34","author":"M Fekete","year":"1912","unstructured":"Fekete, M., P\u00f3lya, G.: \u00dcber ein problem von laguerre. Rend. Circ. Mat. Palermo (1884-1940) 34(1), 89\u2013120 (1912)","journal-title":"Rend. Circ. Mat. Palermo (1884-1940)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02126-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02126-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02126-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T16:01:25Z","timestamp":1740758485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02126-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,8]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2126"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02126-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,8]]},"assertion":[{"value":"31 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no financial or non-financial interests that are directly or indirectly related to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}