{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:37:16Z","timestamp":1771389436516,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,5]],"date-time":"2012-01-05T00:00:00Z","timestamp":1325721600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10479-011-1057-2","type":"journal-article","created":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T20:52:46Z","timestamp":1325710366000},"page":"181-200","source":"Crossref","is-referenced-by-count":11,"title":["Strategies in competing subset selection"],"prefix":"10.1007","volume":"207","author":[{"given":"Claudia","family":"Marini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaia","family":"Nicosia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Pacifici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,5]]},"reference":[{"key":"1057_CR1","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1145\/1109557.1109677","volume-title":"Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms","author":"G. Aggarwal","year":"2006","unstructured":"Aggarwal, G., & Hartline, J. D. (2006). Knapsack auctions. In Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (pp. 1083\u20131092)."},{"key":"1057_CR2","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press."},{"key":"1057_CR3","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.orl.2009.01.007","volume":"37","author":"L. Brotcorne","year":"2009","unstructured":"Brotcorne, L., Hanafi, S., & Mansi, R. (2009). A dynamic programming algorithm for the bilevel knapsack problem. Operations Research Letters, 37, 215\u2013218.","journal-title":"Operations Research Letters"},{"key":"1057_CR4","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1016\/j.tcs.2010.02.005","volume":"411","author":"J. Cardinal","year":"2010","unstructured":"Cardinal, J., & Hoefer, M. (2010). Non-cooperative facility location and covering games. Theoretical Computer Science, 411, 1855\u20131876.","journal-title":"Theoretical Computer Science"},{"key":"1057_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-44683-4_3","volume-title":"Playing games with algorithms: algorithmic combinatorial game theory","author":"E. D. Demaine","year":"2001","unstructured":"Demaine, E. D. (2001). In Lecture notes in computer science: Vol. 2136. Playing games with algorithms: algorithmic combinatorial game theory (pp. 18\u201333)."},{"key":"1057_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1504\/IJOR.2009.026241","volume":"6","author":"G. Felici","year":"2008","unstructured":"Felici, G., Mecoli, M., Mirchandani, P. B., & Pacifici, A. (2008). Equilibrium in a two-agent assignment problem. International Journal of Operational Research, 6, 4\u201326.","journal-title":"International Journal of Operational Research"},{"key":"1057_CR7","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2004.09.036","volume":"171","author":"M. Fujimoto","year":"2006","unstructured":"Fujimoto, M., & Yamada, T. (2006). An exact algorithm for the knapsack sharing problem with common items. European Journal of Operational Research, 171, 693\u2013707.","journal-title":"European Journal of Operational Research"},{"key":"1057_CR8","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1016\/j.cor.2003.11.005","volume":"32","author":"M. Hifi","year":"2005","unstructured":"Hifi, M., M\u2019Hallab, H., & Sadfi, S. (2005). An exact algorithm for the knapsack sharing problem. Computers and Operations Research, 32, 1311\u20131324.","journal-title":"Computers and Operations Research"},{"key":"1057_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01756027","volume":"16","author":"J. Kahn","year":"1987","unstructured":"Kahn, J., Lagarias, J. C., & Witsenhausen, H. S. (1987). Single-suit two-person card play. International Journal of Game Theory, 16, 291\u2013320.","journal-title":"International Journal of Game Theory"},{"key":"1057_CR10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(92)90250-E","volume":"35","author":"N. Katoh","year":"1992","unstructured":"Katoh, N., Koyanagi, J., Ohnishi, M., & Ibaraki, T. (1992). Optimal strategies for some team games. Discrete Applied Mathematics, 35, 275\u2013291.","journal-title":"Discrete Applied Mathematics"},{"key":"1057_CR11","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"J. Y.-T. Leung","year":"2010","unstructured":"Leung, J. Y.-T., Pinedo, M., & Wan, G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58, 458\u2013469.","journal-title":"Operations Research"},{"key":"1057_CR12","unstructured":"Marini, C., Nicosia, G., Pacifici, A., & Pferschy, U. (2010). Minimum cost subset selection with two competing agents. Dipartimento di Informatica e Automazione, Universit\u00e0 \u201cRoma Tre\u201d, Technical Report RT-DIA-179-2010."},{"issue":"16","key":"1057_CR13","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1016\/j.dam.2010.11.011","volume":"159","author":"G. Nicosia","year":"2011","unstructured":"Nicosia, G., Pacifici, A., & Pferschy, U. (2011). Competitive subset selection with two agents. Discrete Applied Mathematics, 159(16), 1865\u20131877.","journal-title":"Discrete Applied Mathematics"},{"key":"1057_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0165-1765(98)00067-6","volume":"59","author":"K. H. Schlag","year":"1998","unstructured":"Schlag, K. H., & Sela, A. (1998). You play (an action) only once. Economics Letters, 59, 299\u2013303.","journal-title":"Economics Letters"},{"key":"1057_CR15","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1016\/j.tcs.2009.12.002","volume":"411","author":"Z. Wang","year":"2010","unstructured":"Wang, Z., Xing, W., & Fang, S.-C. (2010). Two-group knapsack game. Theoretical Computer Science, 411, 1094\u20131103.","journal-title":"Theoretical Computer Science"},{"key":"1057_CR16","doi-asserted-by":"crossref","first-page":"R43","DOI":"10.37236\/1940","volume":"12","author":"J. W\u00e4stlund","year":"2005","unstructured":"W\u00e4stlund, J. (2005). A solution of two-person single-suit whist. The Electronic Journal of Combinatorics, 12, R43.","journal-title":"The Electronic Journal of Combinatorics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-1057-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-1057-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-1057-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T01:37:35Z","timestamp":1593481055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-1057-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["1057"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-1057-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,5]]}}}