Dániel Gerbner, Balázs Keszegh, Kartal Nagy, Balázs Patkós, Gábor Wiener
{"title":"Cooperation in combinatorial search","authors":"Dániel Gerbner, Balázs Keszegh, Kartal Nagy, Balázs Patkós, Gábor Wiener","doi":"10.1007/s11590-024-02120-1","DOIUrl":null,"url":null,"abstract":"<p>In the game theoretical approach of the basic problem in Combinatorial Search an adversary thinks of a defective element <i>d</i> of an <i>n</i>-element pool <i>X</i>, and the questioner needs to find <i>x</i> by asking questions of type is <span>\\(d\\in Q?\\)</span> for certain subsets <i>Q</i> of <i>X</i>. 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.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"30 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Letters","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11590-024-02120-1","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
In the game theoretical approach of the basic problem in Combinatorial Search an adversary thinks of a defective element d of an n-element pool X, and the questioner needs to find x by asking questions of type is \(d\in Q?\) for certain subsets Q of X. 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.
期刊介绍:
Optimization Letters is an international journal covering all aspects of optimization, including theory, algorithms, computational studies, and applications, and providing an outlet for rapid publication of short communications in the field. Originality, significance, quality and clarity are the essential criteria for choosing the material to be published.
Optimization Letters has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time one of the most striking trends in optimization is the constantly increasing interdisciplinary nature of the field.
Optimization Letters aims to communicate in a timely fashion all recent developments in optimization with concise short articles (limited to a total of ten journal pages). Such concise articles will be easily accessible by readers working in any aspects of optimization and wish to be informed of recent developments.