{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:27:56Z","timestamp":1743107276347,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710322"},{"type":"electronic","value":"9783031710339"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-71033-9_3","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:17Z","timestamp":1725321737000},"page":"35-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Team Order Problem: Maximizing the\u00a0Probability of\u00a0Matching Being Large Enough"],"prefix":"10.1007","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiarui","family":"Gan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Lisowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pourmiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0167-7152(91)90170-V","volume":"11","author":"W Ehm","year":"1991","unstructured":"Ehm, W.: Binomial approximation to the Poisson binomial distribution. Stat. Probab. Lett. 11(1), 7\u201316 (1991)","journal-title":"Stat. Probab. Lett."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ahani, N., G\u00f6lz, P., Procaccia, A.D., Teytelboym, A., Trapp, A.C.: Dynamic placement in refugee resettlement. In: The 22nd ACM Conference on Economics and Computation, p.\u00a05. ACM (2021)","DOI":"10.1145\/3465456.3467534"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Allan, B., Omer, L., Nisarg, S., Tyrone, S.: Primarily about primaries. In: The Thirty-Third AAAI Conference on Artificial Intelligence, pp. 1804\u20131811 (2019)","DOI":"10.1609\/aaai.v33i01.33011804"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1613\/jair.4856","volume":"54","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Brill, M., Fischer, F., Harrenstein, P., Lang, J., Seedig, H.G.: Possible and necessary winners of partial tournaments. J. Artif. Intell. Res. 54, 493\u2013534 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Stursberg, P., Walsh, T.: Fixing a balanced knockout tournament. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pp. 552\u2013558. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8805"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1007\/s00453-019-00650-0","volume":"82","author":"H Aziz","year":"2020","unstructured":"Aziz, H., Bir\u00f3, P., Gaspers, S., de Haan, R., Mattei, N., Rastegari, B.: Stable matching with uncertain linear preferences. Algorithmica 82, 1410\u20131433 (2020)","journal-title":"Algorithmica"},{"issue":"6373","key":"3_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1126\/science.aao4408","volume":"359","author":"K Bansak","year":"2018","unstructured":"Bansak, K., et al.: Improving refugee integration through data-driven algorithmic assignment. Science 359(6373), 325\u2013329 (2018)","journal-title":"Science"},{"issue":"1\u20132","key":"3_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-009-0307-4","volume":"128","author":"A Berger","year":"2011","unstructured":"Berger, A., Bonifaci, V., Grandoni, F., Sch\u00e4fer, G.: Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128(1\u20132), 355\u2013372 (2011)","journal-title":"Math. Program."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Burkhard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. SIAM (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"DP Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge (2009)"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/9781108937535","volume-title":"Online and Matching-Based Market Design","author":"F Echenique","year":"2023","unstructured":"Echenique, F., Immorlica, N., Vazirani, V.V.: Online and Matching-Based Market Design. Cambridge University Press, Cambridge (2023)"},{"key":"3_CR12","unstructured":"Faliszewski, P., Gourv\u00e8s, L., Lang, J., Lesca, J., Monnot, J.: How hard is it for a party to nominate an election winner? In: IJCAI (2016)"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1111\/ecin.12907","volume":"58","author":"Q Fu","year":"2020","unstructured":"Fu, Q., Lu, J.: On equilibrium player ordering in dynamic team contests. Econ. Inq. 58(4), 1830\u20131844 (2020)","journal-title":"Econ. Inq."},{"issue":"7","key":"3_CR14","doi-asserted-by":"publisher","first-page":"2120","DOI":"10.1257\/aer.20121469","volume":"105","author":"Q Fu","year":"2015","unstructured":"Fu, Q., Lu, J., Pan, Y.: Team contests with multiple pairwise battles. Am. Econ. Rev. 105(7), 2120\u201340 (2015)","journal-title":"Am. Econ. Rev."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Gaonkar, A., Raghunathan, D., Weinberg, S.M.: The derby game: an ordering-based Colonel Blotto game. In: EC 2022: The 23rd ACM Conference on Economics and Computation, pp. 184\u2013207. ACM (2022)","DOI":"10.1145\/3490486.3538367"},{"key":"3_CR16","unstructured":"Geerdes, H.F., Szab\u00f3, J.: A unified proof for Karzanov\u2019s exact matching theorem. Technical report QP-2011-02, Egerv\u00e1ry Research Group, Budapest (2011). www.cs.elte.hu\/egres"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0166-218X(00)00241-9","volume":"108","author":"W Kern","year":"2001","unstructured":"Kern, W., Paulusma, D.: The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Appl. Math. 108(3), 317\u2013323 (2001)","journal-title":"Discrete Appl. Math."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.geb.2021.12.006","volume":"132","author":"H Konishi","year":"2022","unstructured":"Konishi, H., Pan, C.Y., Simeonov, D.: Equilibrium player choices in team contests with multiple pairwise battles. Games Econ. Behav. 132, 274\u2013287 (2022)","journal-title":"Games Econ. Behav."},{"issue":"1\u20132","key":"3_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-68279-0_2","volume-title":"50 Years of Integer Programming 1958-2008","author":"HW Kuhn","year":"2010","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 29\u201347. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_2"},{"issue":"1","key":"3_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-020-79139-8","volume":"11","author":"J Li","year":"2021","unstructured":"Li, J., Convertino, M.: Inferring ecosystem networks as information flows. Sci. Rep. 11(1), 1\u201322 (2021)","journal-title":"Sci. Rep."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-031-20614-6_14","volume-title":"Multi-Agent Systems","author":"G Lisowski","year":"2022","unstructured":"Lisowski, G.: Strategic nominee selection in tournament solutions. In: Baumeister, D., Rothe, J. (eds.) EUMAS 2022. LNCS, vol. 13442, pp. 239\u2013256. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20614-6_14"},{"key":"3_CR23","unstructured":"Lisowski, G., Ramanujan, M., Turrini, P.: Equilibrium computation for knockout tournaments played by groups. In: International Conference on Autonomous Agents and Multiagent Systems. AAMAS (2022)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. AMS Chelsea Publishing (2009)","DOI":"10.1090\/chel\/367"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Mohamed, M.H., Khafagy, M.H., Ibrahim, M.H.: Recommender systems challenges and solutions survey. In: 2019 International Conference on Innovative Trends in Computer Engineering (ITCE), pp. 149\u2013155. IEEE (2019)","DOI":"10.1109\/ITCE.2019.8646645"},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00199-005-0071-5","volume":"29","author":"B Roberson","year":"2006","unstructured":"Roberson, B.: The Colonel Blotto game. Econ. Theor. 29(1), 1\u201324 (2006)","journal-title":"Econ. Theor."},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Shubik, M., Weber, R.J.: Systems defense games: Colonel Blotto, command and control. Cowles Foundation Discussion Papers\u00a0489, Cowles Foundation for Research in Economics, Yale University (1978)","DOI":"10.21236\/ADA054204"},{"key":"3_CR28","unstructured":"Tang, P., Shoham, Y., Lin, F.: Team competition. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 241\u2013248. IFAAMAS (2009)"},{"key":"3_CR29","unstructured":"Tang, W., Tang, F.: The Poisson binomial distribution \u2013 old & new (2019)"},{"key":"3_CR30","unstructured":"Vassilevska-Williams, V.: Knockout tournaments. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, chap.\u00a019. Cambridge University Press (2016)"},{"key":"3_CR31","unstructured":"Vu, T., Altman, A., Shoham, Y.: On the complexity of schedule control problems for knockout tournaments. In: AAMAS (2009)"},{"issue":"1\u20133","key":"3_CR32","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0166-218X(01)00300-6","volume":"121","author":"T Yi","year":"2002","unstructured":"Yi, T., Murty, K.G., Spera, C.: Matchings in colored bipartite networks. Discrete Appl. Math. 121(1\u20133), 261\u2013277 (2002)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71033-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:03:09Z","timestamp":1725321789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}