{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T17:26:18Z","timestamp":1790443578728,"version":"4.1.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031333767","type":"print"},{"value":"9783031333774","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33377-4_19","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T09:02:36Z","timestamp":1685178156000},"page":"243-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Multi-player MAB Approach for\u00a0Distributed Selection Problems"],"prefix":"10.1007","author":[{"given":"Jinyu","family":"Mo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"issue":"4","key":"19_CR1","first-page":"731","volume":"29","author":"A Anandkumar","year":"2011","unstructured":"Anandkumar, A., Michael, N., Tang, A.K., Swami, A.: Distributed algorithms for learning and cognitive medium access with logarithmic regret. IEEE JSAC 29(4), 731\u2013745 (2011)","journal-title":"IEEE JSAC"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Avner, O., Mannor, S.: Concurrent bandits and cognitive radio networks. In: ECML (2014)","DOI":"10.1007\/978-3-662-44848-9_5"},{"issue":"8","key":"19_CR3","first-page":"1271","volume":"74","author":"B Awerbuch","year":"2008","unstructured":"Awerbuch, B., Kleinberg, R.: Competitive collaborative learning. JCSS 74(8), 1271\u20131288 (2008)","journal-title":"JCSS"},{"key":"19_CR4","unstructured":"Besson, L., Kaufmann, E.: Multi-player bandits revisited. In: ALT (2018)"},{"key":"19_CR5","unstructured":"Bistritz, I., Leshem, A.: Distributed multi-player bandits-a game of thrones approach. In: NeurIPS (2018)"},{"key":"19_CR6","unstructured":"Boursier, E., Perchet, V.: Sic-mmab: Synchronisation involves communication in multiplayer multi-armed bandits. In: NeurIPS (2019)"},{"key":"19_CR7","unstructured":"Bubeck, S., Budzinski, T.: Coordination without communication: optimal regret in two players multi-armed bandits. In: COLT (2020)"},{"key":"19_CR8","unstructured":"Dubey, A., et al.: Cooperative multi-agent bandits with heavy tails. In: ICML (2020)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Hanawal, M.K., Darak, S.: Multi-player bandits: a trekking approach. IEEE TAC (2021)","DOI":"10.1109\/TAC.2021.3077454"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Landgren, P., Srivastava, V., Leonard, N.E.: Distributed cooperative decision-making in multiarmed bandits: frequentist and Bayesian algorithms. In: CDC (2016)","DOI":"10.1109\/ECC.2016.7810293"},{"issue":"11","key":"19_CR11","first-page":"5667","volume":"58","author":"K Liu","year":"2010","unstructured":"Liu, K., Zhao, Q.: Distributed learning in multi-armed bandit with multiple players. IEEE TSP 58(11), 5667\u20135681 (2010)","journal-title":"IEEE TSP"},{"key":"19_CR12","unstructured":"Lugosi, G., Mehrabian, A.: Multiplayer bandits without observing collision information. arXiv preprint arXiv:1808.08416 (2018)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Magesh, A., Veeravalli, V.V.: Multi-user mabs with user dependent rewards for uncoordinated spectrum access. In: CSSC (2019)","DOI":"10.1109\/IEEECONF44664.2019.9048964"},{"key":"19_CR14","unstructured":"Mart\u00ednez-Rubio, D., Kanade, V., Rebeschini, P.: Decentralized cooperative stochastic bandits. In: NeurIPS (2019)"},{"key":"19_CR15","unstructured":"Mehrabian, A., Boursier, E., Kaufmann, E., Perchet, V.: A practical algorithm for multiplayer bandits when arm means vary among players. In: AISTAT (2020)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Mo, J., Xie, H.: A Multi-player MAB Approach for Distributed Selection Problems (2023). https:\/\/www.dropbox.com\/s\/oidjkrbeukzd7pd\/supplementary.pdf?dl=0","DOI":"10.1007\/978-3-031-33377-4_19"},{"key":"19_CR17","unstructured":"Rosenski, J., Shamir, O., Szlak, L.: Multi-player bandits-a musical chairs approach. In: ICML (2016)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Shi, C., Xiong, W., Shen, C., Yang, J.: Decentralized multi-player multi-armed bandits with no collision information. In: AISTAT (2020)","DOI":"10.1109\/TSP.2021.3093261"},{"key":"19_CR19","unstructured":"WANG, P.A., Proutiere, A., Ariu, K., Jedra, Y., Russo, A.: Optimal algorithms for multiplayer multi-armed bandits. In: AISTAT (2020)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33377-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T12:04:18Z","timestamp":1686917058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33377-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031333767","9783031333774"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33377-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"813","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":"143","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":"18% - 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.5","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":"10","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)"}}]}}