Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization.

@inproceedings{shirokovskikh-2026-fast, author = {Svetlana Shirokovskikh and Ekaterina Solodneva and Hosein Azarbonyad and Aleksandr Katrutsa and Ioannis Arapakis and Anastasiia Soboleva and Konstantinos Athanasakos and Roman Loginov and Ekaterina Solodneva and Hosein Azarbonyad and Egor Samosvat and Joemon M. Jose and Aleksandr Katrutsa and Ioannis Arapakis and Konstantinos Athanasakos and Roman Loginov and Egor Samosvat and Joemon M. Jose}, editor = {Hannah Bast and Alistair Moffat and Falk Scholer and Marc Najork and Min Zhang and Hannah Bast and Marc Najork and Min Zhang}, title = {{Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization}}, booktitle = {{Proceedings of the 49th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2026, MelbourneVICAustralia, July 20-24, 2026}}, pages = {4886--4890}, publisher = {ACM}, year = {2026}, url = {https://doi.org/10.1145/3805712.3808449}, doi = {https://doi.org/10.1145/3805712.3808449} }