Approximating combinatorial contracts with a cardinality constraint

DOI10.1007/S10878-025-01307-1MaRDI QIDQ6976849zbMATH OpenFDO

Authors Qinqin Gong, Ling Gai, Yanjun Jiang, Yang Lv, Ruiqi Yang

Publication date 31 May 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-025-01307-1

zbMATH Keywords

approximation algorithmscontracts designprincipal-agent model

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems
• Aggregation and Linearity in the Provision of Intertemporal Incentives
• An Analysis of the Principal-Agent Problem
• Combinatorial agency
• Combinatorial auctions with decreasing marginal utilities
• Combinatorial contracts
• Combinatorial contracts beyond Gross substitutes
• Computing optimal contracts in combinatorial agencies
• Free-riding and free-labor in combinatorial agency
• Mixed strategies in combinatorial agency
• Multi-agent contracts
• On supermodular contracts and dense subgraphs

This page was built for publication: Approximating combinatorial contracts with a cardinality constraint

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