Balanced Allocations with Incomplete Information: The Power of Two Queries
View / Open Files
Authors
Los, D
Sauerwald, T
Publication Date
2022-01-01Journal Title
Leibniz International Proceedings in Informatics, LIPIcs
ISSN
1868-8969
ISBN
9783959772174
Volume
215
Type
Conference Object
This Version
VoR
Metadata
Show full item recordCitation
Los, D., & Sauerwald, T. (2022). Balanced Allocations with Incomplete Information: The Power of Two Queries. Leibniz International Proceedings in Informatics, LIPIcs, 215 https://doi.org/10.4230/LIPIcs.ITCS.2022.103
Abstract
We consider the allocation of m balls into n bins with incomplete information. In the classical Two-Choice process a ball first queries the load of two randomly chosen bins and is then placed in the least loaded bin. In our setting, each ball also samples two random bins but can only estimate a bin's load by sending binary queries of the form “Is the load at least the median?” or “Is the load at least 100?”. For the lightly loaded case m = O(n), Feldheim and Gurel-Gurevich (2021) showed that with one query it is possible to achieve a maximum load of (Equation presented), and they also pose the question whether a maximum load of (Equation presented) is possible for any m = Ω(n). In this work, we resolve this open problem by proving a lower bound of m/n + Ω(√log n) for a fixed m = Θ(n√log n), and a lower bound of m/n + Ω(log n/log log n) for some m depending on the used strategy. We complement this negative result by proving a positive result for multiple queries. In particular, we show that with only two binary queries per chosen bin, there is an oblivious strategy which ensures a maximum load of m/n + O(√log n) for any m ≥ 1. Further, for any number of k = O(log log n) binary queries, the upper bound on the maximum load improves to m/n + O(k(log n)1/k) for any m ≥ 1. This result for k queries has several interesting consequences: (i) it implies new bounds for the (1 + β)-process introduced by Peres, Talwar and Wieder (2015), (ii) it leads to new bounds for the graphical balanced allocation process on dense expander graphs, and (iii) it recovers and generalizes the bound of m/n + O(log log n) on the maximum load achieved by the Two-Choice process, including the heavily loaded case m = Ω(n) which was derived in previous works by Berenbrink et al. (2006) as well as Talwar and Wieder (2014). One novel aspect of our proofs is the use of multiple super-exponential potential functions, which might be of use in future work.
Sponsorship
European Research Council (679660)
Identifiers
External DOI: https://doi.org/10.4230/LIPIcs.ITCS.2022.103
This record's URL: https://www.repository.cam.ac.uk/handle/1810/334972
Statistics
Total file downloads (since January 2020). For more information on metrics see the
IRUS guide.
Recommended or similar items
The current recommendation prototype on the Apollo Repository will be turned off on 03 February 2023. Although the pilot has been fruitful for both parties, the service provider IKVA is focusing on horizon scanning products and so the recommender service can no longer be supported. We recognise the importance of recommender services in supporting research discovery and are evaluating offerings from other service providers. If you would like to offer feedback on this decision please contact us on: support@repository.cam.ac.uk