@InProceedings{dinev_et_al:LIPIcs.ITCS.2024.39,
  author =	{Dinev, Atanas and Weinberg, S. Matthew},
  title =	{{Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids}},
  booktitle =	{15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
  pages =	{39:1--39:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-309-6},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{287},
  editor =	{Guruswami, Venkatesan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.39},
  URN =		{urn:nbn:de:0030-drops-195677},
  doi =		{10.4230/LIPIcs.ITCS.2024.39},
  annote =	{Keywords: online contention resolutions schemes, prophet inequalities, online algorithms, approximation algorithms}
}