Approximating continuous multi-agent contracts with Lyapunov function methods

DOI10.1007/978-981-96-1093-8_35MaRDI QIDQ6955093zbMATH OpenFDO

Authors Qinqin Gong, Donglei Du, Ling Gai, Dachuan Xu, Ruiqi Yang

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1093-8_35

zbMATH Keywords

approximation algorithmscontract designDR-submodularityLyapunov function methodprincipal-agent model

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems
• An Analysis of the Principal-Agent Problem
• Combinatorial contracts
• Combinatorial contracts beyond Gross substitutes
• Computing optimal contracts in combinatorial agencies
• Free-riding and free-labor in combinatorial agency
• Learning approximately optimal contracts
• Mixed strategies in combinatorial agency
• Multi-agent contracts
• On supermodular contracts and dense subgraphs
• On the (In)approximability of combinatorial contracts
• The complexity of contracts

This page was built for publication: Approximating continuous multi-agent contracts with Lyapunov function methods

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