{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:57:41Z","timestamp":1743037061927,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_35","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:02Z","timestamp":1739999882000},"page":"420-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Continuous Multi-agent Contracts with\u00a0Lyapunov Function Methods"],"prefix":"10.1007","author":[{"given":"Qinqin","family":"Gong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Gai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Alon, T., D\u00fctting, P., Talgam-Cohen, I.: Contracts with private cost per unit-of-effort. In: Proceedings of ACM EC, pp. 52\u201369 (2021)","DOI":"10.1145\/3465456.3467651"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Combinatorial agency. In: Proceedings of ACM EC, pp. 18\u201328 (2006)","DOI":"10.1145\/1134707.1134710"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1613\/jair.2961","volume":"38","author":"M Babaioff","year":"2010","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Mixed strategies in combinatorial agency. J. Artif. Intell. Res. 38, 339\u2013369 (2010)","journal-title":"J. Artif. Intell. Res."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Free-riding and free-labor in combinatorial agency. In: Proceedings of SAGT 2009, pp. 109\u2013121 (2009)","DOI":"10.1007\/978-3-642-04645-2_11"},{"key":"35_CR5","unstructured":"Bacchiocchi, F., Castiglioni, M., Marchesi, A., Gatti, N.: Learning optimal contracts: How to exploit small action spaces. arXiv: 2309.09801 (2023)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Bastani, H., Bayati, M., Braverman, M., Gummadi, R., Johari, R.: Analysis of medicare pay-for-performance contracts. Available at SSRN 2839143 (2016)","DOI":"10.2139\/ssrn.2839143"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Bechtel, C., Dughmi, S., Patel, N.: Delegated pandora\u2019s box. In: Proceedings of ACM EC, pp. 666\u2013693 (2022)","DOI":"10.1145\/3490486.3538267"},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1257\/aer.20131159","volume":"105","author":"G Carroll","year":"2015","unstructured":"Carroll, G.: Robustness and linear contracts. Am. Econ. Rev. 105(2), 536\u2013563 (2015)","journal-title":"Am. Econ. Rev."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Castiglioni, M., Marchesi, A., Gatti, N.: Bayesian agency: linear versus tractable contracts. In: Proceedings of ACM EC, pp. 285\u2013286 (2021)","DOI":"10.1145\/3465456.3467602"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Castiglioni, M., Marchesi, A., Gatti, N.: Designing menus of contracts efficiently: the power of randomization. In: Proceedings of ACM EC, pp. 705\u2013735 (2022)","DOI":"10.1145\/3490486.3538270"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Castiglioni, M., Marchesi, A., Gatti, N.: Multi-agent contract design: how to commission multiple agents with individual outcomes. In: Proceedings of ACM EC, pp. 412\u2013448 (2023)","DOI":"10.1145\/3580507.3597793"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Z., Deng, X., Huang, Z.: Are bounded contracts learnable and approximately optimal? arXiv: 2402.14486 (2024)","DOI":"10.1145\/3670865.3673483"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, A., Deligkas, A., Koren, M.: Learning approximately optimal contracts. In: Proceedings of SAGT, pp. 331\u2013346 (2022)","DOI":"10.1007\/978-3-031-15714-1_19"},{"issue":"5","key":"35_CR14","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/rfs\/hhz007","volume":"32","author":"L Cong","year":"2019","unstructured":"Cong, L., He, Z.: Blockchain disruption and smart contracts. Rev. Financ. Stud. 32(5), 1754\u20131797 (2019)","journal-title":"Rev. Financ. Stud."},{"key":"35_CR15","unstructured":"Du, D.: Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization. arXiv:2205.12442 (2022)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Ezra, T., Feldman, M., Kesselheim, T.: Combinatorial contracts. In: Proceedings of FOCS, pp. 815\u2013826 (2022)","DOI":"10.1109\/FOCS52979.2021.00084"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Ezra, T., Feldman, M., Kesselheim, T.: Multi-agent contracts. In: Proceedings of STOC, pp. 1311\u20131324 (2023)","DOI":"10.1145\/3564246.3585193"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Feldman, M., Gal Tzur, Y.: Combinatorial contracts beyond gross substitutes. In: Proceedings of SODA, pp. 92\u2013108 (2024)","DOI":"10.1137\/1.9781611977912.5"},{"key":"35_CR19","unstructured":"D\u00fctting, P., Feldman, M., Gal-Tzur, Y., Rubinstein, A.: The query complexity of contracts. arXiv: 2403.09794 (2024)"},{"key":"35_CR20","unstructured":"D\u00fctting, P., Guruganesh, G., Schneider, J., Wang, J.: Optimal no-regret learning for one-side lipschitz functions. In: Proceedings of ICML, pp. 8836\u20138850 (2023)"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Roughgarden, T., Talgam-Cohen, I.: Simple versus optimal contracts. In: Proceedings of ACM EC, pp. 369\u2013387 (2019)","DOI":"10.1145\/3328526.3329591"},{"issue":"1","key":"35_CR22","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/20M132153X","volume":"50","author":"P Dutting","year":"2021","unstructured":"Dutting, P., Roughgarden, T., Talgam-Cohen, I.: The complexity of contracts. SIAM J. Comput. 50(1), 211\u2013254 (2021)","journal-title":"SIAM J. Comput."},{"key":"35_CR23","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2012.05.018","volume":"452","author":"Y Emek","year":"2012","unstructured":"Emek, Y., Feldman, M.: Computing optimal contracts in combinatorial agencies. Theoret. Comput. Sci. 452, 56\u201374 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR24","unstructured":"Ezra, T., Feldman, M., Schlesinger, M.: On the (In) approximability of combinatorial contracts. In: Proceedings of ITCS (2024)"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: Proceedings of FOCS, pp. 570\u2013579 (2011)","DOI":"10.1109\/FOCS.2011.46"},{"issue":"1","key":"35_CR26","doi-asserted-by":"publisher","first-page":"7","DOI":"10.2307\/1912246","volume":"51","author":"S Grossman","year":"1983","unstructured":"Grossman, S., Hart, O.: An analysis of the principal-agent problem. Econometrica 51(1), 7\u201345 (1983)","journal-title":"Econometrica"},{"key":"35_CR27","doi-asserted-by":"crossref","unstructured":"Guruganesh, G., Schneider, J., Wang, J.: Contracts under moral hazard and adverse selection. In: Proceedings of ACM EC, pp. 563\u2013582 (2021)","DOI":"10.1145\/3465456.3467637"},{"key":"35_CR28","unstructured":"Han, M., Albert, M., Xu, H.: Learning in online principle-agent interactions: the power of menus. arXiv:2312.09869 (2023)"},{"key":"35_CR29","unstructured":"Hassani, H., Soltanolkotabi, M., Karbasi, A.: Gradient methods for submodular maximization. In: Proceedings of NIPS, pp. 5841\u20135851 (2017)"},{"key":"35_CR30","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1613\/jair.4940","volume":"55","author":"C Ho","year":"2016","unstructured":"Ho, C., Slivkins, A., Vaughan, J.: Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems. J. Artif. Intell. Res. 55, 317\u2013359 (2016)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"35_CR31","doi-asserted-by":"publisher","first-page":"74","DOI":"10.2307\/3003320","volume":"10","author":"B Holmstr\u00f6m","year":"1979","unstructured":"Holmstr\u00f6m, B.: Moral hazard and observability. Bell J. Econ. 10(1), 74\u201391 (1979)","journal-title":"Bell J. Econ."},{"key":"35_CR32","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Kleinberg, R.: Delegated search approximates efficient search. In: Proceedings of ACM EC, pp. 287\u2013302 (2018)","DOI":"10.1145\/3219166.3219205"},{"key":"35_CR33","doi-asserted-by":"crossref","unstructured":"Li, Y., Hartline, J.D., Shan, L., Wu, Y.: Optimization of scoring rules. In: Proceedings of ACM EC, pp. 988\u2013989 (2022)","DOI":"10.1145\/3490486.3538338"},{"issue":"2","key":"35_CR34","first-page":"134","volume":"63","author":"A Ross","year":"1973","unstructured":"Ross, A.: The economic theory of agency: the principal\u2019s problem. Am. Econ. Rev. 63(2), 134\u2013139 (1973)","journal-title":"Am. Econ. Rev."},{"key":"35_CR35","unstructured":"Statista Research Department. Instagram infuencer marketing spending worldwide from 2013 to 2020 (2021). https:\/\/www.statista.com\/statistics\/950920\/global-instagram-infuencer-marketing-spending\/"},{"key":"35_CR36","doi-asserted-by":"crossref","unstructured":"Vuong, R., Dughmi, S., Patel, N., Prasad, A.: On supermodular contracts and dense subgraphs. In: Proceedings of ACM-SIAM SODA, pp. 109\u2013132 (2024)","DOI":"10.1137\/1.9781611977912.6"},{"key":"35_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102390","volume":"102","author":"J Xia","year":"2021","unstructured":"Xia, J., Niu, W.: Carbon-reducing contract design for a supply chain with environmental responsibility under asymmetric information. Omega 102, 102390 (2021)","journal-title":"Omega"},{"key":"35_CR38","doi-asserted-by":"crossref","unstructured":"Zhu, B., Bates, S., Yang, Z., Wang, Y., Jiao, J., Jordan, M.: The sample complexity of online contract design. arXiv:2211.05732 (2022)","DOI":"10.1145\/3580507.3597673"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:29Z","timestamp":1739999909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}