{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:54:30Z","timestamp":1755035670912,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031228315"},{"type":"electronic","value":"9783031228322"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22832-2_5","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T09:05:33Z","timestamp":1670490333000},"page":"78-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Team Formation Under Different Synergies"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Eichhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddhartha","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kempe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"issue":"9","key":"5_CR1","first-page":"808","volume":"102","author":"M Aigner","year":"1995","unstructured":"Aigner, M.: Tur\u00e1n\u2019s graph theorem. Am. Math. Mon. 102(9), 808\u2013816 (1995)","journal-title":"Am. Math. Mon."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Combinatorial agency. In: Proceedings of 7th ACM Conference on Electronic Commerce, pp. 18\u201328 (2006)","DOI":"10.1145\/1134707.1134710"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Carlier, G., Ekeland, I.: Matching for teams. Econ. Theory 42, 397\u2013418 (2010)","DOI":"10.1007\/s00199-008-0415-z"},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.jcss.2012.01.001","volume":"78","author":"N Cesa-Bianchi","year":"2012","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Combinatorial bandits. J. Comput. Syst. Sci. 78(5), 1404\u20131422 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR5","unstructured":"Chen, W., Wang, Y., Yuan, Y.: General framework and applications. In: ICML, Combinatorial Multi-armed Bandit (2013)"},{"key":"5_CR6","unstructured":"Combes, R., Sadegh Talebi, M., Proutiere, A., Lelarge, M.: Combinatorial bandits revisited. In: Proceedings of 29th Advances in Neural Information Processing Systems, pp. 2116\u20132124 (2015)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K.: Online matching with concave returns. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 137\u2013144 (2012)","DOI":"10.1145\/2213977.2213992"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1109\/TNET.2011.2181864","volume":"20","author":"Y Gai","year":"2012","unstructured":"Gai, Y., Krishnamachari, B., Jain, R.: Combinatorial network optimization with unknown variables: multi-armed bandits with linear rewards and individual observations. IEEE\/ACM Trans. Networking 20(5), 1466\u20131478 (2012)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"5_CR9","unstructured":"Gopalan, A., Mannor, S., Mansour, Y.: Thompson sampling for complex online problems. In: International Conference on Machine Learning, pp. 100\u2013108. PMLR (2014)"},{"key":"5_CR10","unstructured":"Han, Y., Wang, Y., Chen, X.: Adversarial combinatorial bandits with general non-linear reward functions. In: International Conference on Machine Learning, pp. 4030\u20134039 (2021)"},{"key":"5_CR11","unstructured":"Hssaine, C., Banerjee, S.: Information signal design for incentivizing team formation. In: Proceedings of 14th Conference on Web and Internet Economics (WINE) (2018)"},{"key":"5_CR12","unstructured":"Johari, R., Kamble, V., Krishnaswamy, A.K., Li, H.: Exploration vs. exploitation in team formation. In: Proceedings of 14th Conference on Web and Internet Economics (WINE) (2018)"},{"key":"5_CR13","unstructured":"Katariya, S., Kveton, B., Szepesvari, C., Vernade, C., Wen, Z.: Stochastic rank-1 bandits. In: Artificial Intelligence and Statistics, pp. 392\u2013401. PMLR (2017)"},{"key":"5_CR14","unstructured":"Kirschner, J., Lattimore, T., Krause, A.: Information directed sampling for linear partial monitoring. In: Conference on Learning Theory, pp. 2328\u20132369. PMLR (2020)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Raghu, M.: Team performance with test scores. In: Proceedings of 16th ACM Conference on Economics and Computation (2015)","DOI":"10.1145\/2764468.2764496"},{"key":"5_CR16","unstructured":"Branislav Kveton, Zheng Wen, Azin Ashkan, and Csaba Szepesv\u00e1ri. Tight regret bounds for stochastic combinatorial semi-bandits. In Proc. 18th Intl. Conf. on Artificial Intelligence and Statistics, 2015"},{"key":"5_CR17","unstructured":"Merlis, N., Mannor, S.: Tight lower bounds for combinatorial multi-armed bandits. In: Conference on Learning Theory, pp. 2830\u20132857. PMLR (2020)"},{"key":"5_CR18","unstructured":"Rajkumar, A., Mukherjee, K., Tulabandhula, T.: Learning to partition using score based compatibilities. In: Proceedings of 16th International Conference on Autonomous Agents and Multiagent Systems, pp. 574\u2013582 (2017)"},{"key":"5_CR19","unstructured":"Russo, D., Van Roy, B.: Learning to optimize via information-directed sampling. Advances in Neural Information Processing Systems, 27 (2014)"},{"key":"5_CR20","unstructured":"Sentenac, F., Yi, J., Calauzenes, C., Perchet, V., Vojnovic, M.: Pure exploration and regret minimization in matching bandits. In: ICML21, pp. 9434\u20139442 (2021)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Singla, A., Horvitz, E., Kohli, P., Krause, A.: Learning to hire teams. In: Third AAAI Conference on Human Computation and Crowdsourcing (2015)","DOI":"10.1609\/hcomp.v3i1.13243"},{"issue":"3","key":"5_CR22","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: Egy gr\u00e1felm\u00e9leti sz\u00e9lso\u00e9rt\u00e9kfeladatr\u00f3l (on an extremal problem in graph theory). Mat. Fiz. Lapok 48(3), 436\u2013453 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"5_CR23","unstructured":"Wang, S., Chen, W.: Thompson sampling for combinatorial semi-bandits. In: International Conference on Machine Learning, pp. 5114\u20135122. PMLR (2018)"},{"key":"5_CR24","unstructured":"Zimmert, J., Seldin, Y.: Factored bandits. Advances in Neural Information Processing Systems 31 (2018)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22832-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:46:45Z","timestamp":1710269205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22832-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228315","9783031228322"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22832-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Troy, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.rpi.edu\/wine2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19 abstracts in the back matter","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}