{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:07Z","timestamp":1740145147696,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T00:00:00Z","timestamp":1714694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T00:00:00Z","timestamp":1714694400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100018818","name":"National Research, Development and Innovation Office","doi-asserted-by":"publisher","award":["SNN 129364","FK 132060","KKP-133819","K 132696","ELTE TKP 2021-NKTA-62","TKP2021 BME-NVA-02"],"award-info":[{"award-number":["SNN 129364","FK 132060","KKP-133819","K 132696","ELTE TKP 2021-NKTA-62","TKP2021 BME-NVA-02"]}],"id":[{"id":"10.13039\/501100018818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015498","name":"Innov\u00e1ci\u00f3s \u00e9s Technol\u00f3giai Miniszt\u00e9rium","doi-asserted-by":"publisher","award":["\u00daNKP-21-5","\u00daNKP-22-5"],"award-info":[{"award-number":["\u00daNKP-21-5","\u00daNKP-22-5"]}],"id":[{"id":"10.13039\/501100015498","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","award":["ERMiD"],"award-info":[{"award-number":["ERMiD"]}],"id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009934","name":"E\u00f6tv\u00f6s Lor\u00e1nd University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009934","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In the game theoretical approach of the basic problem in Combinatorial Search an adversary thinks of a defective element <jats:italic>d<\/jats:italic> of an <jats:italic>n<\/jats:italic>-element pool <jats:italic>X<\/jats:italic>, and the questioner needs to find <jats:italic>x<\/jats:italic> by asking questions of type is <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$d\\in Q?$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:mi>Q<\/mml:mi>\n                    <mml:mo>?<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> for certain subsets <jats:italic>Q<\/jats:italic> of <jats:italic>X<\/jats:italic>. We study cooperative versions of this problem, where there are multiple questioners, but not all of them learn the answer to the queries. We consider various models that differ in how it is decided who gets to ask the next query, who obtains the answer to the query, and who needs to know the defective element by the end of the process.<\/jats:p>","DOI":"10.1007\/s11590-024-02120-1","type":"journal-article","created":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T10:02:15Z","timestamp":1714730535000},"page":"329-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cooperation in combinatorial search"],"prefix":"10.1007","volume":"19","author":[{"given":"D\u00e1niel","family":"Gerbner","sequence":"first","affiliation":[]},{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9504-7551","authenticated-orcid":false,"given":"Kartal","family":"Nagy","sequence":"additional","affiliation":[]},{"given":"Bal\u00e1zs","family":"Patk\u00f3s","sequence":"additional","affiliation":[]},{"given":"G\u00e1bor","family":"Wiener","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,3]]},"reference":[{"key":"2120_CR1","volume-title":"Combinatorial Search","author":"M Aigner","year":"1988","unstructured":"Aigner, M.: Combinatorial Search. Wiley, Hoboken (1988)"},{"key":"2120_CR2","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Botler, F., Dross, F., Naia, T., Skokan J.: Separating the edges of a graph by a linear number of paths. (2023). arXiv preprint arXiv:2301.08707","DOI":"10.19086\/aic.2023.6"},{"key":"2120_CR3","unstructured":"Birk\u00e1s, G.y., Hrask\u00f3, A.: Personal communication (2022)"},{"key":"2120_CR4","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A.G., Vorobyev, I.V., Polyanskii, N.A., Shchukin, V.Y.: On a hypergraph approach to multistage group testing problems. In 2016 IEEE International Symposium on Information Theory (ISIT), pp. 1183\u20131191. IEEE, (2016)","DOI":"10.1109\/ISIT.2016.7541486"},{"key":"2120_CR5","doi-asserted-by":"publisher","DOI":"10.1142\/4252","volume-title":"Combinatorial Group Testing and Its Applications","author":"D-Z Du","year":"1999","unstructured":"Du, D.-Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. World Scientific, Singapore (1999)"},{"key":"2120_CR6","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1090\/S0002-9904-1945-08454-7","volume":"51","author":"P Erd\u0151s","year":"1945","unstructured":"Erd\u0151s, P.: On a lemma of littlewood and offord. Bull. Am. Math. Soc. 51, 898\u2013902 (1945)","journal-title":"Bull. Am. Math. Soc."},{"key":"2120_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/S0021-9800(66)80024-8","volume":"1","author":"G Katona","year":"1966","unstructured":"Katona, G.: On separating systems of a finite set. J. Combin. Theory 1, 174\u2013194 (1966)","journal-title":"J. Combin. Theory"},{"key":"2120_CR8","unstructured":"Letzter, S.: Separating paths systems of almost linear size. arXiv preprint arXiv:2211.07732 (2022)"},{"issue":"1\u20132","key":"2120_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0304-3975(01)00303-6","volume":"270","author":"A Pelc","year":"2002","unstructured":"Pelc, A.: Searching games with errors-fifty years of coping with liars. Theoret. Comput. Sci. 270(1\u20132), 71\u2013109 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"2120_CR10","first-page":"17","volume":"12","author":"S R\u00f3ka","year":"1990","unstructured":"R\u00f3ka, S.: Independent intersection systems (in Hungarian). Acta Acad. Paedag. Ny\u00edregyh\u00e1ziensis 12, 17\u201320 (1990)","journal-title":"Acta Acad. Paedag. Ny\u00edregyh\u00e1ziensis"},{"key":"2120_CR11","first-page":"67","volume":"24","author":"S R\u00f3ka","year":"1997","unstructured":"R\u00f3ka, S.: Independent intersection systems II. Acta Acad. Paedag. Agriensis, Sect. Math. 24, 67\u201373 (1997). (in Hungarian)","journal-title":"Acta Acad. Paedag. Agriensis, Sect. Math."},{"key":"2120_CR12","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/S0021-9800(70)80038-2","volume":"8","author":"J Spencer","year":"1970","unstructured":"Spencer, J.: Minimal completely separating systems. J. Combin. Theory 8, 446\u2013447 (1970)","journal-title":"J. Combin. Theory"},{"issue":"1","key":"2120_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1017\/S0963548300000080","volume":"1","author":"J Spencer","year":"1992","unstructured":"Spencer, J., Winkler, P.: Three thresholds for a liar. Comb. Probab. Comput. 1(1), 81\u201393 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"2120_CR14","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner, E.: Ein Satz \u00fcber Untermengen einer endlichen Menge. Math. Z. 27, 544\u2013548 (1928)","journal-title":"Math. Z."},{"key":"2120_CR15","doi-asserted-by":"crossref","unstructured":"Vorobyev, I.: Optimal multistage group testing algorithm for 3 defectives. In 2020 IEEE International Symposium on Information Theory (ISIT), pp. 90\u201395. IEEE, (2020)","DOI":"10.1109\/ISIT44484.2020.9173966"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02120-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02120-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02120-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T07:06:18Z","timestamp":1738652778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02120-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2120"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02120-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,5,3]]},"assertion":[{"value":"3 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}