Cooperation in combinatorial search

Gerbner, Dániel and Keszegh, Balázs and Nagy, Kartal and Patkós, Balázs and Wiener, Gábor (2024) Cooperation in combinatorial search. OPTIMIZATION LETTERS. ISSN 1862-4472 (In Press)

Preview

Text s11590-024-02120-1.pdf - Published Version Available under License Creative Commons Attribution. Download (1MB) | Preview

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? d ∈ 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.

Actions (login required)

Edit Item