Linear contracts for supermodular functions based on graphs

DOI10.1007/978-3-032-03639-1_23MaRDI QIDQ6851584zbMATH OpenFDO

Authors Kanstantsin Pashkovich, Jacob Skitsko

Publication date 27 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-03639-1_23

Mathematics Subject Classification ID

Contract theory (moral hazard, adverse selection) (91B41) Principal-agent models (91B43)

Cites work

• scientific article; zbMATH DE number 1263204 (Why is no real title available?)
• Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory's theorem
• Combinatorial contracts
• Combinatorial contracts beyond Gross substitutes
• Computing optimal contracts in combinatorial agencies
• Multi-agent contracts
• On oblivious PTAS's for nash equilibrium
• On supermodular contracts and dense subgraphs
• On the (In)approximability of combinatorial contracts
• Technical Note—Incomplete Information VCG Contracts for Common Agency
• The complexity of contracts

This page was built for publication: Linear contracts for supermodular functions based on graphs

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