On the (In)approximability of combinatorial contracts

DOI10.4230/LIPICS.ITCS.2024.44MaRDI QIDQ6906390zbMATH OpenFDO

Authors Tomer Ezra, Michal Feldman, Maya Schlesinger

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.44

zbMATH Keywords

algorithmic contract designcombinatorial contractsmoral hazard

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A threshold of ln n for approximating set cover
• An Analysis of the Principal-Agent Problem
• Combinatorial agency
• Combinatorial contracts
• Computing optimal contracts in combinatorial agencies
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Multi-agent contracts
• The communication requirements of efficient allocations and supporting prices
• The complexity of contracts

Cited in

(7)

• Linear contracts for supermodular functions based on graphs
• Improved approximation algorithms for combinatorial contracts with type constraints
• Combinatorial contracts
• Approximating continuous multi-agent contracts with Lyapunov function methods
• Approximating principal-agent problem under Bayesian
• Algorithmic contract theory: a survey
• Multi-agent contracts

This page was built for publication: On the (In)approximability of combinatorial contracts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906390)