Combinatorial contracts beyond Gross substitutes

DOI10.1137/1.9781611977912.5MaRDI QIDQ6645346zbMATH OpenFDO

Authors Paul Dütting, Michal Feldman, Yoav Gal Tzur

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.5

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(10)

• 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 combinatorial contracts with a cardinality constraint
• Learning optimal contracts with small action spaces
• Approximating principal-agent problem under Bayesian
• Algorithmic contract theory: a survey
• Price of non-discrimination in public combinatorial contracts
• Designing exploration contracts

This page was built for publication: Combinatorial contracts beyond Gross substitutes

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