当合同变得复杂时:信息论障碍
When Contracts Get Complex: Information-Theoretic Barriers
AI总结:
研究发现,对于子模函数f和加法函数c,寻找最优合同需要指数级需求查询,揭示了信息论限制下的合同设计难题。
摘要:
在组合动作合同模型(Dütting等人,FOCS'21)中,委托人将执行一个复杂项目委托给代理人,代理人可以选择给定动作集合中的任意子集。每个动作集合对代理人造成成本,由集合函数c给出,同时给委托人带来预期收益,由集合函数f给出。为了激励代理人,委托人设计一个合同,规定成功时的付款,最优合同是使委托人效用最大化的合同。\n\n已知在能够进行价值查询的情况下,对于子模函数f和加法函数c,无法获得常数近似解。一个基本的开放问题是:在允许进行需求查询的情况下,问题是否变得可处理?我们通过证明,对于子模函数f和加法函数c,寻找最优合同需要指数级的需求查询,从而回答了这个问题的否定。我们利用我们技术的鲁棒性,将这一结果扩展并加强到不同的子模/超模函数f和c的组合;同时允许委托人使用任意通信协议访问f和c。\n\n我们的结果由新的等收益构造驱动,当其中一个函数是加法时,立即推导出价值查询的难度。然后我们识别出一个新的属性——稀疏需求——这使我们能够将这些结果扩展到需求查询的难度。最后,通过在这些构造中添加一个额外的动作,从而使两个函数都成为组合函数,我们建立了指数级的通信复杂性。
英文摘要:
In the combinatorial-action contract model (Dütting et al., FOCS'21) a principal delegates the execution of a complex project to an agent, who can choose any subset from a given set of actions. Each set of actions incurs a cost to the agent, given by a set function $c$, and induces an expected reward to the principal, given by a set function $f$. To incentivize the agent, the principal designs a contract that specifies the payment upon success, with the optimal contract being the one that maximizes the principal's utility. It is known that with access to value queries no constant-approximation is possible for submodular $f$ and additive $c$. A fundamental open problem is: does the problem become tractable with demand queries? We answer this question to the negative, by establishing that finding an optimal contract for submodular $f$ and additive $c$ requires exponentially many demand queries. We leverage the robustness of our techniques to extend and strengthen this result to different combinations of submodular/supermodular $f$ and $c$; while allowing the principal to access $f$ and $c$ using arbitrary communication protocols. Our results are driven by novel equal-revenue constructions when one of the functions is additive, immediately implying value query hardness. We then identify a new property -- sparse demand -- which allows us to strengthen these results to demand query hardness. Finally, by augmenting a perturbed version of these constructions with one additional action, thereby making both functions combinatorial, we establish exponential communication complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。