Fraknói, Ádám X. and Márton, Dávid Á. and Simon, Dániel G. and Lenger, Dániel Antal (2023) On the Rényi–Ulam game with restricted size queries. DISCRETE OPTIMIZATION, 48 (1). ISSN 1572-5286
|
Text
2104.01664v4.pdf Available under License Creative Commons Attribution. Download (199kB) | Preview |
Official URL: https://doi.org/10.1016/j.disopt.2023.100772
Abstract
We investigate the following version of the well-known Rényi–Ulam game. Two players — the Questioner and the Responder — play against each other. The Responder thinks of a number from the set {1, . . . ,
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | combinatorial searching, adaptive searching, Rényi–Ulam liar game, small sets |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 11:33 |
| Last Modified: | 05 Apr 2024 11:33 |
| URI: | https://real.mtak.hu/id/eprint/191883 |
Actions (login required)
 |
Edit Item |
