{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:54:22Z","timestamp":1740160462801,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T00:00:00Z","timestamp":1536364800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T00:00:00Z","timestamp":1536364800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1619339","1151076"],"award-info":[{"award-number":["1619339","1151076"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s13235-018-0283-5","type":"journal-article","created":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T05:17:40Z","timestamp":1536383860000},"page":"942-964","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Iterative Computation of Security Strategies of Matrix Games with Growing Action Set"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6698-4271","authenticated-orcid":false,"given":"Lichun","family":"Li","sequence":"first","affiliation":[]},{"given":"Cedric","family":"Langbort","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"issue":"4","key":"283_CR1","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1287\/opre.2014.1289","volume":"62","author":"S Agrawal","year":"2014","unstructured":"Agrawal S, Wang Z, Ye Y (2014) A dynamic near-optimal algorithm for online linear programming. Oper Res 62(4):876\u2013890","journal-title":"Oper Res"},{"key":"283_CR2","doi-asserted-by":"crossref","unstructured":"Ba\u015far T, Olsder GJ (1998) Dynamic noncooperative game theory. SIAM","DOI":"10.1137\/1.9781611971132"},{"key":"283_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.automatica.2016.02.018","volume":"69","author":"SD Bopardikar","year":"2016","unstructured":"Bopardikar SD, Langbort C (2016) On incremental approximate saddle-point computation in zero-sum matrix games. Automatica 69:150\u2013156","journal-title":"Automatica"},{"issue":"1","key":"283_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01917108","volume":"26","author":"KH Borgwardt","year":"1982","unstructured":"Borgwardt KH (1982) The average number of pivot steps required by the simplex-method is polynomial. Math Methods Oper Res 26(1):157\u2013177","journal-title":"Math Methods Oper Res"},{"key":"283_CR5","volume-title":"The simplex method: a probabilistic analysis","author":"KH Borgwardt","year":"2012","unstructured":"Borgwardt KH (2012) The simplex method: a probabilistic analysis, vol 1. Springer, Berlin"},{"key":"283_CR6","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"2016","unstructured":"Dantzig G (2016) Linear programming and extensions. Princeton University Press, Princeton"},{"key":"283_CR7","unstructured":"Devanur NR, Hayes TP (2009) The adwords problem: online keyword matching with budgeted bidders under random permutations. In: Proceedings of the 10th ACM conference on electronic commerce. ACM, pp 71\u201378"},{"key":"283_CR8","unstructured":"Eghbali R, Fazel M (2016) Worst case competitive analysis of online algorithms for conic optimization. arXiv:161100507"},{"key":"283_CR9","unstructured":"Feldman J, Henzinger M, Korula N, Mirrokni V, Stein C (2010) Online stochastic packing applied to display ad allocation. In: European symposium on algorithms. Springer, 2010, pp 182\u2013194"},{"key":"283_CR10","unstructured":"Iouditski A (2016) Course note of convex optimization i: introduction. http:\/\/ljk.imag.fr\/membres\/Anatoli.Iouditski\/cours\/convex\/chapitre_2.pdf"},{"key":"283_CR11","unstructured":"Kleinberg R (2005) A multiple-choice secretary algorithm with applications to online auctions. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp 630\u2013631"},{"issue":"ROSO\u2013CONF\u20131972\u2013","key":"283_CR12","first-page":"248","volume":"2","author":"TM Liebling","year":"1972","unstructured":"Liebling TM, Henn R, K\u00fcnzi H, Schubert H (1972) On the number of iterations of the simplex method. Methods Oper Res 2(ROSO\u2013CONF\u20131972\u2013001):248\u2013264","journal-title":"Methods Oper Res"},{"key":"283_CR13","volume-title":"A note on random LP-problems","author":"PO Lindberg","year":"1981","unstructured":"Lindberg PO (1981) A note on random LP-problems. Department of Mathematics, Royal Institute of Technology, Stockholm"},{"issue":"1","key":"283_CR14","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/moor.2013.0612","volume":"39","author":"M Molinaro","year":"2013","unstructured":"Molinaro M, Ravi R (2013) The geometry of online packing linear programs. Math Oper Res 39(1):46\u201359","journal-title":"Math Oper Res"},{"issue":"2","key":"283_CR15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/BF01851006","volume":"9","author":"WM Schmidt","year":"1968","unstructured":"Schmidt WM (1968) Some results in probabilistic geometry. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete 9(2):158\u2013162","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"issue":"3","key":"283_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"DA Spielman","year":"2004","unstructured":"Spielman DA, Teng SH (2004) Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J ACM: JACM 51(3):385\u2013463","journal-title":"J ACM: JACM"},{"key":"283_CR17","doi-asserted-by":"crossref","unstructured":"Tsai J, Yin Z, Kwak Jy, Kempe D, Kiekintveld C, Tambe M (2010) Urban security: game-theoretic resource allocation in networked physical domains. In: National conference on artificial intelligence (AAAI)","DOI":"10.1609\/aaai.v24i1.7612"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-018-0283-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13235-018-0283-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-018-0283-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T23:39:36Z","timestamp":1693870776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13235-018-0283-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,8]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s13235-018-0283-5","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"type":"print","value":"2153-0785"},{"type":"electronic","value":"2153-0793"}],"subject":[],"published":{"date-parts":[[2018,9,8]]},"assertion":[{"value":"8 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}