{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:37:06Z","timestamp":1742971026866,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":39,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777518"},{"type":"electronic","value":"9789819777525"}],"license":[{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"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-97-7752-5_15","type":"book-chapter","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T10:05:29Z","timestamp":1735380329000},"page":"185-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Principal-Agent Problem Under Bayesian"],"prefix":"10.1007","author":[{"given":"Qinqin","family":"Gong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Gai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yijing","family":"Wang","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":[[2024,12,29]]},"reference":[{"key":"15_CR1","unstructured":"Scientific background on the 2016 Nobel price in economic sciences. Royal Swedish Academy of Sciences (2016)"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/1885099","volume":"97","author":"G Akerlof","year":"1982","unstructured":"Akerlof, G.: Labor contracts as partial gift-exchange. Q. J. Econ. 97(4), 543\u2013569 (1982)","journal-title":"Q. J. Econ."},{"key":"15_CR3","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":"15_CR4","doi-asserted-by":"crossref","unstructured":"Alon, T., D\u00fctting, P., Li, Y., Talgam-Cohen, I.: Bayesian analysis of linear contracts. arXiv:2211.06850 (2022)","DOI":"10.1145\/3580507.3597795"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Free-riding and free-labor in combinatorial agency. In: Proceedings of SAGT, pp. 109\u2013121 (2009)","DOI":"10.1007\/978-3-642-04645-2_11"},{"key":"15_CR6","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."},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1016\/j.jet.2012.01.010","volume":"147","author":"M Babaioff","year":"2012","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Combinatorial agency. J. Econ. Theory 147(3), 999\u20131034 (2012)","journal-title":"J. Econ. Theory"},{"key":"15_CR8","unstructured":"Bodek, K., Feldman, M.: Maximizing sums of non-monotone submodular and linear functions: understanding the unconstrained case. arXiv:2204.03412 (2022)"},{"issue":"2","key":"15_CR9","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":"15_CR10","doi-asserted-by":"crossref","unstructured":"Castiglioni, M., Chen, J., Li, M., Xu, H., Zuo, S.: A reduction from multi-parameter to single-parameter Bayesian contract design. arXiv:2404.03476v1 (2024)","DOI":"10.1137\/1.9781611978322.56"},{"key":"15_CR11","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":"15_CR12","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"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1257\/aer.20220100","volume":"114","author":"H Castro-Pires","year":"2024","unstructured":"Castro-Pires, H., Chade, H., Swinkels, J.: Disentangling moral hazard and adverse selection. Am. Econ. Rev. 114(1), 1\u201337 (2024)","journal-title":"Am. Econ. Rev."},{"issue":"5","key":"15_CR14","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1086\/250036","volume":"106","author":"P Diamond","year":"1998","unstructured":"Diamond, P.: Managerial incentives: on the near linearity of optimal compensation. J. Polit. Econ. 106(5), 931\u201357 (1998)","journal-title":"J. Polit. Econ."},{"key":"15_CR15","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":"15_CR16","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":"15_CR17","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":"15_CR18","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":"15_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/20M132153X","volume":"50","author":"P D\u00fctting","year":"2021","unstructured":"D\u00fctting, P., Roughgarden, T., Talgam-Cohen, I.: The complexity of contracts. SIAM J. Comput. 50(1), 211\u2013254 (2021)","journal-title":"SIAM J. Comput."},{"key":"15_CR20","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. Theor. Comput. Sci. 452, 56\u201374 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR21","unstructured":"Ezra, T., Feldman, M., Schlesinger, M.: On the (in) approximability of combinatorial contracts. In: Proceedings of ITCS (2024)"},{"issue":"4","key":"15_CR22","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\ln n$$ for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.3982\/TE2992","volume":"17","author":"D Gottlieb","year":"2022","unstructured":"Gottlieb, D., Moreira, H.: Simple contracts with adverse selection and moral hazard. Theor. Econ. 17(3), 1357\u20131401 (2022)","journal-title":"Theor. Econ."},{"issue":"1","key":"15_CR24","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":"15_CR25","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":"15_CR26","doi-asserted-by":"crossref","unstructured":"Guruganesh, G., Schneider, J., Wang, J., Zhao, J.: The power of menus in contract design. In: Proceedings of ACM EC, pp. 818\u2013848 (2023)","DOI":"10.1145\/3580507.3597735"},{"key":"15_CR27","unstructured":"Harshaw, C., Feldman, M., Ward, J., Karbasi, A.: Submodular maximization beyond non-negativity: guarantees, fast algorithms, and applications. In: Proceedings of ICML, pp. 2634\u20132643 (2019)"},{"key":"15_CR28","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":"15_CR29","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."},{"issue":"2","key":"15_CR30","doi-asserted-by":"publisher","first-page":"303","DOI":"10.2307\/1913238","volume":"55","author":"B Holmstr\u00f6m","year":"1987","unstructured":"Holmstr\u00f6m, B., Milgrom, P.: Aggregation and linearity in the provision of intertemporal incentives. Econometrica 55(2), 303\u2013328 (1987)","journal-title":"Econometrica"},{"issue":"10","key":"15_CR31","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.14778\/3467861.3467866","volume":"14","author":"T Jin","year":"2021","unstructured":"Jin, T., Yang, Y., Yang, R., Shi, J., Huang, K., Xiao, X.: Unconstrained submodular maximization with modular costs: tight approximation and application to profit maximization. Proc. VLDB Endow. 14(10), 1756\u20131768 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Raghavan, M.: How do classifiers induce agents to invest effort strategically? In: Proceedings of ACM EC, pp. 825\u2013844 (2019)","DOI":"10.1145\/3328526.3329584"},{"issue":"4","key":"15_CR33","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1257\/jel.52.4.1075","volume":"52","author":"B K\u00f6szegi","year":"2014","unstructured":"K\u00f6szegi, B.: Behavioral contract theory. J. Econ. Lit. 52(4), 1075\u20131118 (2014)","journal-title":"J. Econ. Lit."},{"issue":"2","key":"15_CR34","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econom. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econom. Behav."},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Lu, C., Yang, W., Gao, S.: Regularized nonmonotone submodular maximization. Optimization 1\u201327 (2023)","DOI":"10.1080\/02331934.2023.2173968"},{"issue":"1","key":"15_CR36","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(82)90006-4","volume":"10","author":"R Myerson","year":"1982","unstructured":"Myerson, R.: Optimal coordination mechanisms in generalized principal-agent problems. J. Math. Econ. 10(1), 67\u201381 (1982)","journal-title":"J. Math. Econ."},{"key":"15_CR37","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"15_CR38","first-page":"30","volume":"2","author":"C Papadimitriou","year":"2007","unstructured":"Papadimitriou, C.: The complexity of finding Nash equilibria. Algorithmic Game Theory 2, 30 (2007)","journal-title":"Algorithmic Game Theory"},{"key":"15_CR39","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"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7752-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:24:10Z","timestamp":1739305450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7752-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,29]]},"ISBN":["9789819777518","9789819777525"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7752-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,29]]},"assertion":[{"value":"29 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"29 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}