Cooperation in combinatorial search

IF 1.3 4区 数学 Q2 MATHEMATICS, APPLIED Optimization Letters Pub Date : 2024-05-03 DOI:10.1007/s11590-024-02120-1
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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
组合搜索中的合作
在 "组合搜索"(Combinatorial Search)基本问题的博弈论方法中,对手会想到一个 n 元素池 X 中的缺陷元素 d,而提问者需要通过对 X 的某些子集 Q 提出 is\(d\in Q?\) 类型的问题来找到 x。我们考虑了不同的模型,这些模型的不同之处在于如何决定由谁来提出下一个问题、由谁来获得问题的答案以及由谁来在过程结束时知道有缺陷的元素。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Optimization Letters
Optimization Letters 管理科学-应用数学
CiteScore
3.40
自引率
6.20%
发文量
116
审稿时长
9 months
期刊介绍: 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.
期刊最新文献
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times A projected fixed point method for a class of vertical tensor complementarity problems The budgeted maximin share allocation problem Explicit iterative algorithms for solving the split equality problems in Hilbert spaces Convergence rate of projected subgradient method with time-varying step-sizes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1