@InProceedings{ezra_et_al:LIPIcs.ITCS.2024.44,
  author =	{Ezra, Tomer and Feldman, Michal and Schlesinger, Maya},
  title =	{{On the (In)approximability of Combinatorial Contracts}},
  booktitle =	{15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
  pages =	{44:1--44:22},
  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.44},
  URN =		{urn:nbn:de:0030-drops-195724},
  doi =		{10.4230/LIPIcs.ITCS.2024.44},
  annote =	{Keywords: algorithmic contract design, combinatorial contracts, moral hazard}
}