SpringerLink
Log in

Pairwise-Independent Contention Resolution

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14679))

  • 206 Accesses

Abstract

We study online contention resolution schemes (OCRSs) and prophet inequalities for non-product distributions. Specifically, when the active set is sampled according to a pairwise-independent (PI) distribution, we show a \((1-o_k(1))\)-selectable OCRS for uniform matroids of rank k, and \(\varOmega (1)\)-selectable OCRSs for laminar, graphic, cographic, transversal, and regular matroids. These imply prophet inequalities with the same ratios when the set of values is drawn according to a PI distribution. Our results complement recent work of Dughmi et al. [14] showing that no \(\omega (1/k)\)-selectable OCRS exists in the PI setting for general matroids of rank k.

A. Gupta—Supported in part by NSF awards CCF-1955785 and CCF-2006953.

R. Levin—Work was done while the author was a Fulbright Israel Postdoctoral Fellow.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (Canada)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adamczyk, M., Wlodarczyk, M.: Random order contention resolution schemes. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7–9 October 2018, pp. 790–801. IEEE Computer Society (2018)

    Google Scholar 

  2. Arsenis, M., Drosis, O., Kleinberg, R.: Constrained-order prophet inequalities. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10–13 January 2021, pp. 2034–2046. SIAM (2021)

    Google Scholar 

  3. Azar, P.D., Kleinberg, R., Weinberg, S.M.: Prophet inequalities with limited information. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5–7 January 2014, pp. 1358–1377. SIAM (2014)

    Google Scholar 

  4. Azar, P.D., Kleinberg, R., Weinberg, S.M.: Prior independent mechanisms via prophet inequalities with limited information. Games Econ. Behav. 118, 511–532 (2019)

    Article  MathSciNet  Google Scholar 

  5. Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4–6 January 2009, pp. 1245–1254. SIAM (2009)

    Google Scholar 

  6. Bateni, M., Dehghani, S., Hajiaghayi, M., Seddighin, S.: Revenue maximization for selling multiple correlated items. In: Bansal, N., Finocchi, I. (eds.) Algorithms - ESA 2015. LNCS, vol. 9294, pp. 95–105. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48350-3_9

    Chapter  Google Scholar 

  7. Caragiannis, I., Gravin, N., Lu, P., Wang, Z.: Relaxing the independence assumption in sequential posted pricing, prophet inequality, and random bipartite matching. In: Feldman, M., Fu, H., Talgam-Cohen, I. (eds.) WINE 2021. LNCS, vol. 13112, pp. 131–148. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-94676-0_8

    Chapter  Google Scholar 

  8. Caramanis, C., Faw, M., Papadigenopoulos, O., Pountourakis, E.: Single-sample prophet inequalities revisited. CoRR abs/2103.13089 (2021)

    Google Scholar 

  9. Chawla, S., Gergatsouli, E., McMahan, J., Tzamos, C.: Approximating Pandora’s box with correlations. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. LIPIcs, Atlanta, Georgia, USA, 11–13 September 2023, vol. 275, pp. 26:1–26:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)

    Google Scholar 

  10. Chekuri, C., Vondrák, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM J. Comput. 43(6), 1831–1879 (2014)

    Article  MathSciNet  Google Scholar 

  11. Correa, J.R., Foncea, P., Hoeksma, R., Oosterwijk, T., Vredeveld, T.: Posted price mechanisms and optimal threshold strategies for random arrivals. Math. Oper. Res. 46(4), 1452–1478 (2021)

    Article  MathSciNet  Google Scholar 

  12. Dinitz, M., Kortsarz, G.: Matroid secretary for regular and decomposable matroids. SIAM J. Comput. 43(5), 1807–1830 (2014)

    Article  MathSciNet  Google Scholar 

  13. Dughmi, S.: Matroid secretary is equivalent to contention resolution. In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022. LIPIcs, Berkeley, CA, USA, 31 January–3 February 2022, vol. 215, pp. 58:1–58:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)

    Google Scholar 

  14. Dughmi, S., Kalayci, Y.H., Patel, N.: Limitations of stochastic selection problems with pairwise independent priors. CoRR abs/2310.05240 (2023)

    Google Scholar 

  15. Esfandiari, H., Hajiaghayi, M., Liaghat, V., Monemizadeh, M.: Prophet secretary. SIAM J. Discrete Math. 31(3), 1685–1701 (2017)

    Article  MathSciNet  Google Scholar 

  16. Feldman, M., Svensson, O., Zenklusen, R.: Online contention resolution schemes. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1014–1033. SIAM (2016)

    Google Scholar 

  17. Giambartolomei, G., Mallmann-Trenn, F., Saona, R.: Prophet inequalities: separating random order from order selection. CoRR abs/2304.04024 (2023)

    Google Scholar 

  18. Goyal, V., Humair, S., Papadigenopoulos, O., Zeevi, A.: MNL-Prophet: sequential assortment selection under uncertainty. CoRR abs/2308.05207 (2023)

    Google Scholar 

  19. Gupta, A., Kehne, G., Levin, R.: Set covering with our eyes wide shut. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 4530–4553. SIAM (2024)

    Google Scholar 

  20. Hill, T.P., Kertz, R.P.: A survey of prophet inequalities in optimal stop** theory. In: Strategies for Sequential Search and Selection in real time, Amherst, MA (1990). Contemp. Math. 125, 191–207. American Mathematical Society, Providence (1992)

    Google Scholar 

  21. Immorlica, N., Singla, S., Waggoner, B.: Prophet inequalities with linear correlations and augmentations. In: EC 2020: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, 13–17 July 2020, pp. 159–185. ACM (2020)

    Google Scholar 

  22. Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities and applications to multi-dimensional mechanism design. Games Econom. Behav. 113, 97–115 (2019)

    Article  MathSciNet  Google Scholar 

  23. Krengel, U., Sucheston, L.: On semiamarts, amarts, and processes with finite value. In: Probability on Banach Spaces. Advanced Probability Related Topics, vol. 4, pp. 197–266. Dekker, New York (1978)

    Google Scholar 

  24. Lee, E., Singla, S.: Optimal online contention resolution schemes via ex-ante prophet inequalities. In: 26th Annual European Symposium on Algorithms, ESA 2018. LIPIcs, Helsinki, Finland, 20–22 August 2018, vol. 112, pp. 57:1–57:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

    Google Scholar 

  25. Luby, M., Wigderson, A.: Pairwise independence and derandomization. Found. Trends Theor. Comput. Sci. 1(4), 237–301 (2005)

    Article  MathSciNet  Google Scholar 

  26. Rinott, Y., Samuel-Cahn, E.: Comparisons of optimal stop** values and prophet inequalities for negatively dependent random variables. Ann. Statist. 15(4), 1482–1490 (1987)

    Article  MathSciNet  Google Scholar 

  27. Rinott, Y., Samuel-Cahn, E.: Optimal stop** values and prophet inequalities for some dependent random variables. In: Stochastic Inequalities, Seattle, WA (1991). IMS Lecture Notes Monograph Series, vol. 22, pp. 343–358. Institute of Mathematical Statistics, Hayward (1992)

    Google Scholar 

  28. Rubinstein, A.: Beyond matroids: secretary problem and prophet inequality with general constraints. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18–21 June 2016, pp. 324–332. ACM (2016)

    Google Scholar 

  29. Rubinstein, A., Singla, S.: Combinatorial prophet inequalities. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16–19 January 2017, pp. 1671–1687. SIAM (2017)

    Google Scholar 

  30. Rubinstein, A., Wang, J.Z., Weinberg, S.M.: Optimal single-choice prophet inequalities from samples. In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. LIPIcs, Seattle, Washington, USA, 12–14 January 2020, vol. 151, pp. 60:1–60:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)

    Google Scholar 

  31. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)

    Google Scholar 

  32. Seymour, P.: Decomposition of regular matroids. A source book in matroid theory, p. 339 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. New York University, New York, NY, USA

    Anupam Gupta

  2. Peking University, Bei**g, China

    **qiao Hu

  3. University of Texas at Austin, Austin, TX, USA

    Gregory Kehne

  4. Rutgers University, New Brunswick, NJ, USA

    Roie Levin

Authors
  1. Anupam Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. **qiao Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gregory Kehne
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Roie Levin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roie Levin .

Editor information

Editors and Affiliations

  1. University of Bonn, Bonn, Germany

    Jens Vygen

  2. University of Wrocław, Wrocław, Poland

    Jarosław Byrka

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gupta, A., Hu, J., Kehne, G., Levin, R. (2024). Pairwise-Independent Contention Resolution. In: Vygen, J., Byrka, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2024. Lecture Notes in Computer Science, vol 14679. Springer, Cham. https://doi.org/10.1007/978-3-031-59835-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-59835-7_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-59834-0

  • Online ISBN: 978-3-031-59835-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation