We consider dynamic pricing algorithms as applied to the online set cover problem. In the dynamic pricing framework, we assume the standard client server model with the additional constraint that the server can only place prices over the resources they maintain, rather than authoritatively assign them. In response, incoming clients choose the resource which minimizes their disutility when taking into account these additional prices. Our main contributions are the categorization of online algorithms which can be mimicked via dynamic pricing algorithms and the identification of a strongly competitive deterministic algorithm with respect to the frequency parameter of the online set cover input.
@article{arxiv.2409.15094,
title = {Dynamic Pricing Algorithms for Online Set Cover},
author = {Max Bender and Aum Desai and Jialin He and Oliver Thompson and Pramithas Upreti},
journal= {arXiv preprint arXiv:2409.15094},
year = {2024}
}