Document Open Access Logo

The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem

Author Shaddin Dughmi

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2020.42.pdf
  • Filesize: 0.51 MB
  • 18 pages

Document Identifiers

Author Details

Shaddin Dughmi
  • Department of Computer Science, University of Southern California, Los Angeles, CA, USA

Funding

  • Dughmi, Shaddin: This work was supported by NSF CAREER Award CCF-1350900.

Cite AsGet BibTex

Shaddin Dughmi. The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 42:1-42:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ICALP.2020.42

Abstract

Contention resolution schemes have proven to be a useful and unifying abstraction for a variety of constrained optimization problems, in both offline and online arrival models. Much of prior work restricts attention to product distributions for the input set of elements, and studies contention resolution for increasingly general packing constraints, both offline and online. In this paper, we instead focus on generalizing the input distribution, restricting attention to matroid constraints in both the offline and online random arrival models. In particular, we study contention resolution when the input set is arbitrarily distributed, and may exhibit positive and/or negative correlations between elements. We characterize the distributions for which offline contention resolution is possible, and establish some of their basic closure properties. Our characterization can be interpreted as a distributional generalization of the matroid covering theorem. For the online random arrival model, we show that contention resolution is intimately tied to the secretary problem via two results. First, we show that a competitive algorithm for the matroid secretary problem implies that online contention resolution is essentially as powerful as offline contention resolution for matroids, so long as the algorithm is given the input distribution. Second, we reduce the matroid secretary problem to the design of an online contention resolution scheme of a particular form.

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Contention Resolution
  • Secretary Problems
  • Matroids

Metrics

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

Related Versions

References

  1. Marek Adamczyk and Michał Włodarczyk. Random order contention resolution schemes. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 790-801. IEEE, 2018. Google Scholar
  2. Shipra Agrawal, Yichuan Ding, Amin Saberi, and Yinyu Ye. Price of correlations in stochastic optimization. Operations Research, 60(1):150-162, 2012. Google Scholar
  3. Saeed Alaei. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM Journal on Computing, 43(2):930-972, 2014. Google Scholar
  4. Pablo D 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, pages 1358-1377. Society for Industrial and Applied Mathematics, 2014. Google Scholar
  5. Yossi Azar, Ashish Chiplunkar, and Haim Kaplan. Prophet secretary: Surpassing the 1-1/e barrier. In Proceedings of the 2018 ACM Conference on Economics and Computation, pages 303-318. ACM, 2018. Google Scholar
  6. Moshe Babaioff, Nicole Immorlica, and Robert Kleinberg. Matroids, secretary problems, and online mechanisms. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pages 434-443. Society for Industrial and Applied Mathematics, 2007. Google Scholar
  7. Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6):1740-1766, 2011. Google Scholar
  8. Shuchi Chawla, Jason D Hartline, David L Malec, and Balasubramanian Sivan. Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the forty-second ACM symposium on Theory of computing, pages 311-320. ACM, 2010. Google Scholar
  9. Chandra Chekuri, Jan Vondrák, and Rico Zenklusen. Dependent randomized rounding via exchange properties of combinatorial structures. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pages 575-584. IEEE, 2010. Google Scholar
  10. Chandra Chekuri, Jan Vondrák, and Rico Zenklusen. Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM Journal on Computing, 43(6):1831-1879, 2014. Google Scholar
  11. José Correa, Paul Dütting, Felix Fischer, and Kevin Schewior. Prophet inequalities for iid random variables from an unknown distribution. In Proceedings of the 2019 ACM Conference on Economics and Computation, pages 3-17. ACM, 2019. Google Scholar
  12. Michael Dinitz. Recent advances on the matroid secretary problem. ACM SIGACT News, 44(2):126-142, 2013. Google Scholar
  13. Evgenii Borisovich Dynkin. The optimum choice of the instant for stopping a markov process. Soviet Mathematics, 4:627-629, 1963. Google Scholar
  14. Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, and Sahil Singla. Prophet secretary for combinatorial auctions and matroids. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 700-714. SIAM, 2018. Google Scholar
  15. Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, and Morteza Monemizadeh. Prophet secretary. SIAM Journal on Discrete Mathematics, 31(3):1685-1701, 2017. Google Scholar
  16. Moran Feldman, Ola Svensson, and Rico Zenklusen. A simple o (log log (rank))-competitive algorithm for the matroid secretary problem. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, pages 1189-1201. SIAM, 2014. Google Scholar
  17. Moran Feldman, Ola Svensson, and Rico Zenklusen. Online contention resolution schemes. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pages 1014-1033. Society for Industrial and Applied Mathematics, 2016. Google Scholar
  18. Mohammad Taghi Hajiaghayi, Robert Kleinberg, and Tuomas Sandholm. Automated online mechanism design and prophet inequalities. In AAAI, volume 7, pages 58-65, 2007. Google Scholar
  19. Theodore P Hill and Robert P Kertz. A survey of prophet inequalities in optimal stopping theory. Contemp. Math, 125:191-207, 1992. Google Scholar
  20. David R Karger. Random sampling and greedy sparsification for matroid optimization problems. Mathematical Programming, 82(1-2):41-81, 1998. Google Scholar
  21. Robert Kleinberg and Seth Matthew Weinberg. Matroid prophet inequalities. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 123-136. ACM, 2012. Google Scholar
  22. Ulrich Krengel and Louis Sucheston. Semiamarts and finite values. Bulletin of the American Mathematical Society, 83(4):745-747, 1977. Google Scholar
  23. Ulrich Krengel and Louis Sucheston. On semiamarts, amarts, and processes with finite value. Probability on Banach spaces, 4:197-266, 1978. Google Scholar
  24. Oded Lachish. O (log log rank) competitive ratio for the matroid secretary problem. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pages 326-335. IEEE, 2014. Google Scholar
  25. Euiwoong Lee and Sahil Singla. Optimal online contention resolution schemes via ex-ante prophet inequalities. In 26th Annual European Symposium on Algorithms (ESA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018. Google Scholar
  26. J. G. Oxley. Matroid Theory. Oxford University Press, 1992. Google Scholar
  27. Yosef Rinott, Ester Samuel-Cahn, et al. Comparisons of optimal stopping values and prophet inequalities for negatively dependent random variables. The Annals of Statistics, 15(4):1482-1490, 1987. Google Scholar
  28. Aviad Rubinstein. Beyond matroids: Secretary problem and prophet inequality with general constraints. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pages 324-332. ACM, 2016. Google Scholar
  29. Ester Samuel-Cahn. Prophet inequalities for bounded negatively dependent random variables. Statistics & probability letters, 12(3):213-216, 1991. Google Scholar
  30. Jack Wang. The prophet inequality can be solved optimally with a single set of samples. arXiv preprint, 2018. URL: http://arxiv.org/abs/1812.10563.
  31. Dominic JA Welsh. Matroid theory. Courier Corporation, 2010. Google Scholar
  32. Qiqi Yan. Mechanism design via correlation gap. In Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms, pages 710-719. Society for Industrial and Applied Mathematics, 2011. Google Scholar
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-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact