Document Open Access Logo

A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions

Authors Noga Alon , Nick Gravin , Tristan Pollner, Aviad Rubinstein , Hongao Wang , S. Matthew Weinberg , Qianfan Zhang

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITCS.2025.4.pdf
  • Filesize: 0.95 MB
  • 22 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
Keywords
  • Prophet Inequalities
  • Online Contention Resolution Schemes
  • Concentration Inequalities

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We investigate prophet inequalities with competitive ratios approaching 1, seeking to generalize k-uniform matroids. We first show that large girth does not suffice: for all k, there exists a matroid of girth ≥ k and a prophet inequality instance on that matroid whose optimal competitive ratio is 1/2. Next, we show k-fold matroid unions do suffice: we provide a prophet inequality with competitive ratio 1-O(√{(log k)/k}) for any k-fold matroid union. Our prophet inequality follows from an online contention resolution scheme.
The key technical ingredient in our online contention resolution scheme is a novel bicriterion concentration inequality for arbitrary monotone 1-Lipschitz functions over independent items which may be of independent interest. Applied to our particular setting, our bicriterion concentration inequality yields "Chernoff-strength" concentration for a 1-Lipschitz function that is not (approximately) self-bounding.

Cite As Get BibTex

Noga Alon, Nick Gravin, Tristan Pollner, Aviad Rubinstein, Hongao Wang, S. Matthew Weinberg, and Qianfan Zhang. A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 4:1-4:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ITCS.2025.4

Author Details

Noga Alon
  • Department of Mathematics, Princeton University, NJ, USA
  • Schools of Mathematics and Computer Science, Tel Aviv University, Tel Aviv, Israel
Nick Gravin
  • Key Laboratory of Interdisciplinary Research of Computation and Economics, Shanghai University of Finance and Economics, China
Tristan Pollner
  • Department of Management Science and Engineering, Stanford University, CA, USA
Aviad Rubinstein
  • Department of Computer Science, Stanford University, CA, USA
Hongao Wang
  • Department of Computer Science, Purdue University, West Lafayette, IN, USA
S. Matthew Weinberg
  • Department of Computer Science, Princeton University, NJ, USA
Qianfan Zhang
  • Department of Computer Science, Princeton University, NJ, USA

Funding

  • Alon, Noga: Research supported in part by NSF grant DMS-2154082.
  • Gravin, Nick: Research is supported by National Key R & D Program of China (2023YFA1009500), NSFC grant 61932002, "the Fundamental Research Funds for the Central Universities in China".
  • Rubinstein, Aviad: Research supported in part by NSF CCF-1954927, and a David and Lucile Packard Fellowship.
  • Weinberg, S. Matthew: Research supported in part by NSF CCF-1955205. During Professor Weinberg’s development of this paper, he participated as an expert witness on behalf of the State of Texas in ongoing litigation against Google (the "Google Litigation").
  • Zhang, Qianfan: Research supported in part by NSF CCF-1955205.

Acknowledgements

The authors are grateful to the anonymous reviewers for helpful feedback on the initial submission of this work.

References

  1. Saeed Alaei. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM Journal on Computing, 43(2):930-972, 2014. URL: https://doi.org/10.1137/120878422.
  2. Saeed Alaei, Hu Fu, Nima Haghpanah, Jason Hartline, and Azarakhsh Malekian. Bayesian optimal auctions via multi- to single-agent reduction. In Proceedings of the 13th ACM Conference on Electronic Commerce, EC '12, page 17, New York, NY, USA, 2012. Association for Computing Machinery. URL: https://doi.org/10.1145/2229012.2229017.
  3. C. J. Argue, Anupam Gupta, Marco Molinaro, and Sahil Singla. Robust secretary and prophet algorithms for packing integer programs. In Joseph (Seffi) Naor and Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pages 1273-1297. SIAM, SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.53.
  4. Pablo Daniel Azar, Robert Kleinberg, and S. Matthew Weinberg. Prophet inequalities with limited information. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 1358-1377, 2014. URL: https://doi.org/10.1137/1.9781611973402.100.
  5. Stéphane Boucheron, Gábor Lugosi, and Pascal Massart. A sharp concentration inequality with applications. Random Structures & Algorithms, 16(3):277-292, 2000. URL: https://doi.org/10.1002/(SICI)1098-2418(200005)16:3%3C277::AID-RSA4%3E3.0.CO;2-1.
  6. Stéphane Boucheron, Gábor Lugosi, and Pascal Massart. Concentration inequalities using the entropy method. The Annals of Probability, 31(3):1583-1614, 2003. Google Scholar
  7. Stephane Boucheron, Gabor Lugosi, and Pascal Massart. On concentration of self-bounding functions. Electronic Journal of Probability, 14:1884-1899, 2009. Google Scholar
  8. Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. Multi-parameter mechanism design and sequential posted pricing. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 311-320. ACM, 2010. URL: https://doi.org/10.1145/1806689.1806733.
  9. Chandra Chekuri, Junkai Song, and Weizhong Zhang. Contention resolution for the l-fold union of a matroid via the correlation gap. In 2024 Symposium on Simplicity in Algorithms (SOSA), pages 396-405. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977936.36.
  10. Atanas Dinev and S. Matthew Weinberg. Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids. In Venkatesan Guruswami, editor, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), volume 287 of Leibniz International Proceedings in Informatics (LIPIcs), pages 39:1-39:23, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ITCS.2024.39.
  11. Paul Dütting, Michal Feldman, Thomas Kesselheim, and Brendan Lucier. Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs. SIAM J. Comput., 49(3):540-582, 2020. URL: https://doi.org/10.1137/20M1323850.
  12. Moran Feldman, Ola Svensson, and Rico Zenklusen. Online contention resolution schemes. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1014-1033. SIAM, 2016. URL: https://doi.org/10.1137/1.9781611974331.ch72.
  13. Mohammad Taghi Hajiaghayi, Robert Kleinberg, and Tuomas Sandholm. Automated online mechanism design and prophet inequalities. In AAAI, volume 7, pages 58-65, 2007. URL: http://www.aaai.org/Library/AAAI/2007/aaai07-009.php.
  14. Jiashuo Jiang, Will Ma, and Jiawei Zhang. Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1221-1246. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.51.
  15. Thomas Kesselheim, Andreas Tönnis, Klaus Radke, and Berthold Vöcking. Primal beats dual on online packing lps in the random-order model. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 303-312, 2014. URL: https://doi.org/10.1145/2591796.2591810.
  16. Robert Kleinberg and S. Matthew Weinberg. Matroid prophet inequalities. In Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, pages 123-136, 2012. URL: https://doi.org/10.1145/2213977.2213991.
  17. Ulrich Krengel and Louis Sucheston. On semiamarts, amarts, and processes with finite value. Advances in Probability and Related Topics, 4:197-266, 1978. Google Scholar
  18. Felix Lazebnik, Vasiliy A Ustimenko, and Andrew J Woldar. A new series of dense graphs of high girth. Bulletin of the American mathematical society, 32(1):73-79, 1995. Google Scholar
  19. Euiwoong Lee and Sahil Singla. Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. In 26th Annual European Symposium on Algorithms (ESA 2018), volume 112, pages 57:1-57:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.ESA.2018.57.
  20. Pascal Massart. About the constants in talagrand’s concentration inequalities for empirical processes. The Annals of Probability, 28(2):863-884, 2000. Google Scholar
  21. Colin McDiarmid et al. On the method of bounded differences. Surveys in combinatorics, 141(1):148-188, 1989. Google Scholar
  22. Colin McDiarmid and Bruce Reed. Concentration for self-bounding functions and an inequality of talagrand. Random Structures & Algorithms, 29(4):549-557, 2006. URL: https://doi.org/10.1002/rsa.20145.
  23. Aviad Rubinstein and Sahil Singla. Combinatorial prophet inequalities. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 1671-1687, 2017. URL: https://doi.org/10.1137/1.9781611974782.110.
  24. Aviad Rubinstein and S. Matthew Weinberg. Simple mechanisms for a subadditive buyer and applications to revenue monotonicity. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, Portland, OR, USA, June 15-19, 2015, pages 377-394, 2015. URL: https://doi.org/10.1145/2764468.2764510.
  25. Ester Samuel-Cahn. Comparison of threshold stop rules and maximum for independent nonnegative random variables. Annals of Probability, 12(4):1213-1216, 1984. Google Scholar
  26. Gideon Schechtman. Concentration, results and applications. In Handbook of the geometry of Banach spaces, volume 2, pages 1603-1634. Elsevier, 2003. Google Scholar
  27. Jan Vondrák. A note on concentration of submodular functions. CoRR, abs/1005.2791, 2010. URL: https://doi.org/10.48550/arXiv.1005.2791.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact