Optimal Common Contract with Heterogeneous Agents

Authors: Shenke Xiao, Zihe Wang, Mengjing Chen, Pingzhong Tang, Xiwang Yang7309-7316

AAAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We first show this problem is NP-complete. Then we provide a dynamic programming algorithm to compute the optimal contract in O(n2m) time, where n, m are the number of agents and actions, under the assumption that the agents cost functions obey increasing difference property. At last, we generalize the setting such that each agent can choose to directly produce a reward in [0, 1]. We provide an O(log n)-approximate algorithm for this generalization.
Researcher Affiliation Collaboration 1Tsinghua University, 2Shanghai University of Finance and Economics, 3Byte Dance xsk15@mails.tsinghua.edu.cn, wang.zihe@mail.shufe.edu.cn, ccchmj@qq.com, kenshinping@gmail.com, yangxiwang@bytedance.com
Pseudocode No The paper describes algorithms verbally and with mathematical formulas (e.g., dynamic programming recursion), but it does not include a formally structured pseudocode block or an algorithm box.
Open Source Code No The paper does not include any explicit statement about releasing open-source code for the described methodology, nor does it provide any links to a code repository.
Open Datasets No The paper is theoretical and focuses on algorithm design and complexity analysis. It does not conduct empirical studies with datasets, thus no mention of publicly available training datasets.
Dataset Splits No The paper is theoretical and does not involve experimental validation on datasets. Therefore, no information on training/validation/test splits is provided.
Hardware Specification No The paper is theoretical and does not report on experiments that would require hardware specifications.
Software Dependencies No The paper is theoretical and does not describe any experimental setup that would require specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and does not describe an experimental setup, hyperparameters, or training configurations.