乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:12:59Z","timestamp":1730326379033,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["317\/17"],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Amazon Research Award","award":[""]},{"name":"ERC","award":["866132"]},{"name":"NSF-BSF","award":["2020788"]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["788893 AMDROMA"],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MIUR PRIN","award":["ALGADIMAR"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585193","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1311-1324","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-agent Contracts"],"prefix":"10.1145","author":[{"given":"Paul","family":"D\u00fctting","sequence":"first","affiliation":[{"name":"Google Research, Switzerland"}]},{"given":"Tomer","family":"Ezra","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Italy"}]},{"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel \/ Microsoft Research, Israel"}]},{"given":"Thomas","family":"Kesselheim","sequence":"additional","affiliation":[{"name":"University of Bonn, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467651"},{"key":"e_1_3_2_1_2_1","unstructured":"Itai Ashlagi Wanyi Li and Irene Lo. 2022. Simple and Approximately Optimal Contracts for Payment for Ecosystem Services. Management Science Articles in advance published online \t\t\t\t Itai Ashlagi Wanyi Li and Irene Lo. 2022. Simple and Approximately Optimal Contracts for Payment for Ecosystem Services. Management Science Articles in advance published online"},{"key":"e_1_3_2_1_3_1","first-page":"653","article-title":"Improved Truthful Mechanisms for Subadditive Combinatorial Auctions","volume":"2021","author":"Assadi Sepehr","year":"2021","unstructured":"Sepehr Assadi , Thomas Kesselheim , and Sahil Singla . 2021 . Improved Truthful Mechanisms for Subadditive Combinatorial Auctions : Breaking the Logarithmic Barrier. In Proc. ACM-SIAM SODA 2021. 653 \u2013 661 . Sepehr Assadi, Thomas Kesselheim, and Sahil Singla. 2021. Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. In Proc. ACM-SIAM SODA 2021. 653\u2013661.","journal-title":"Breaking the Logarithmic Barrier. In Proc. ACM-SIAM SODA"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134710"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1892211.1892220"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229025"},{"volume-title":"Proc. ICML","year":"2022","author":"Bechavod Yahav","key":"e_1_3_2_1_8_1","unstructured":"Yahav Bechavod , Chara Podimata , Zhiwei Steven Wu , and Juba Ziani . 2022 . Information Discrepancy in Strategic Learning . In Proc. ICML 2022. 1691\u20131715. Yahav Bechavod, Chara Podimata, Zhiwei Steven Wu, and Juba Ziani. 2022. Information Discrepancy in Strategic Learning. In Proc. ICML 2022. 1691\u20131715."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538267"},{"key":"e_1_3_2_1_10_1","first-page":"700","article-title":"Welfare Guarantees for Combinatorial Auctions with Item Bidding","volume":"2011","author":"Bhawalkar Kshipra","year":"2011","unstructured":"Kshipra Bhawalkar and Tim Roughgarden . 2011 . Welfare Guarantees for Combinatorial Auctions with Item Bidding . In Proc. ACM-SIAM SODA 2011. 700 \u2013 709 . Kshipra Bhawalkar and Tim Roughgarden. 2011. Welfare Guarantees for Combinatorial Auctions with Item Bidding. In Proc. ACM-SIAM SODA 2011. 700\u2013709.","journal-title":"Proc. ACM-SIAM SODA"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520029"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538270"},{"volume-title":"Proc. ACM STOC","year":"2010","author":"Chawla Shuchi","key":"e_1_3_2_1_13_1","unstructured":"Shuchi Chawla , Jason D. Hartline , David L. Malec , and Balasubramanian Sivan . 2010 . Multi-parameter mechanism design and sequential posted pricing . In Proc. ACM STOC 2010. 311\u2013320. Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. 2010. Multi-parameter mechanism design and sequential posted pricing. In Proc. ACM STOC 2010. 311\u2013320."},{"volume-title":"Optimal Scoring Rule Design. CoRR, abs\/2107.07420","year":"2021","author":"Chen Yiling","key":"e_1_3_2_1_14_1","unstructured":"Yiling Chen and Fang-Yi Yu. 2021. Optimal Scoring Rule Design. CoRR, abs\/2107.07420 ( 2021 ), arxiv:2107.07420 Yiling Chen and Fang-Yi Yu. 2021. Optimal Scoring Rule Design. CoRR, abs\/2107.07420 (2021), arxiv:2107.07420"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835172"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1088594"},{"volume-title":"Combinatorial Contracts. In Proc. IEEE FOCS","year":"2021","author":"D\u00fctting Paul","key":"e_1_3_2_1_17_1","unstructured":"Paul D\u00fctting , Tomer Ezra , Michal Feldman , and Thomas Kesselheim . 2021 . Combinatorial Contracts. In Proc. IEEE FOCS 2021. 815\u2013826. Paul D\u00fctting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. 2021. Combinatorial Contracts. In Proc. IEEE FOCS 2021. 815\u2013826."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323850"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00037"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329591"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M132153X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.05.018"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680977"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070810"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488634"},{"key":"e_1_3_2_1_26_1","first-page":"123","article-title":"Combinatorial Auctions via Posted Prices","volume":"2015","author":"Feldman Michal","year":"2015","unstructured":"Michal Feldman , Nick Gravin , and Brendan Lucier . 2015 . Combinatorial Auctions via Posted Prices . In Proc. ACM-SIAM SODA 2015. 123 \u2013 135 . Michal Feldman, Nick Gravin, and Brendan Lucier. 2015. Combinatorial Auctions via Posted Prices. In Proc. ACM-SIAM SODA 2015. 123\u2013135.","journal-title":"Proc. ACM-SIAM SODA"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Hu Fu Robert Kleinberg and Ron Lavi. 2012. Conditional equilibrium outcomes via ascending price processes with applications to combinatorial auctions with item bidding.. In EC. 586. \t\t\t\t Hu Fu Robert Kleinberg and Ron Lavi. 2012. Conditional equilibrium outcomes via ascending price processes with applications to combinatorial auctions with item bidding.. In EC. 586.","DOI":"10.1145\/2229012.2229055"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912246"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1999.2531"},{"volume-title":"Proc. ACM EC","year":"2021","author":"Guruganesh Guru","key":"e_1_3_2_1_30_1","unstructured":"Guru Guruganesh , Jon Schneider , and Joshua R. Wang . 2021. Contracts under Moral Hazard and Adverse Selection . In Proc. ACM EC 2021 . 563\u2013582. Guru Guruganesh, Jon Schneider, and Joshua R. Wang. 2021. Contracts under Moral Hazard and Adverse Selection. In Proc. ACM EC 2021. 563\u2013582."},{"volume-title":"Proc. ICML","year":"2019","author":"Harshaw Chris","key":"e_1_3_2_1_31_1","unstructured":"Chris Harshaw , Moran Feldman , Justin Ward , and Amin Karbasi . 2019 . Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications . In Proc. ICML 2019. 2634\u20132643. Chris Harshaw, Moran Feldman, Justin Ward, and Amin Karbasi. 2019. Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications. In Proc. ICML 2019. 2634\u20132643."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.2307\/3003320"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2307\/3003457"},{"volume-title":"Proc. ACM EC","year":"2018","author":"Jon","key":"e_1_3_2_1_34_1","unstructured":"Jon M. Kleinberg and Robert Kleinberg. 2018. Delegated Search Approximates Efficient Search . In Proc. ACM EC 2018 . 287\u2013302. Jon M. Kleinberg and Robert Kleinberg. 2018. Delegated Search Approximates Efficient Search. In Proc. ACM EC 2018. 287\u2013302."},{"volume-title":"Proc. ACM EC","year":"2019","author":"Jon","key":"e_1_3_2_1_35_1","unstructured":"Jon M. Kleinberg and Manish Raghavan. 2019. How Do Classifiers Induce Agents to Invest Effort Strategically? In Proc. ACM EC 2019 . 825\u2013844. Jon M. Kleinberg and Manish Raghavan. 2019. How Do Classifiers Induce Agents to Invest Effort Strategically? In Proc. ACM EC 2019. 825\u2013844."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2005.02.006"},{"volume-title":"Proc. WINE","year":"2021","author":"Li Wanyi Dai","key":"e_1_3_2_1_37_1","unstructured":"Wanyi Dai Li , Nicole Immorlica , and Brendan Lucier . 2021 . Contract Design for Afforestation Programs . In Proc. WINE 2021. 113\u2013130. Wanyi Dai Li, Nicole Immorlica, and Brendan Lucier. 2021. Contract Design for Afforestation Programs. In Proc. WINE 2021. 113\u2013130."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538338"},{"volume-title":"Instagram influencer marketing spending worldwide from 2013 to","year":"2020","author":"Statista Research Department","key":"e_1_3_2_1_39_1","unstructured":"Statista Research Department . 2021. Instagram influencer marketing spending worldwide from 2013 to 2020 . https:\/\/www.statista.com\/statistics\/950920\/global-instagram-influencer-marketing-spending\/. Statista Research Department. 2021. Instagram influencer marketing spending worldwide from 2013 to 2020. https:\/\/www.statista.com\/statistics\/950920\/global-instagram-influencer-marketing-spending\/."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0842"},{"volume-title":"Proc. ACM STOC","year":"2013","author":"Vasilis","key":"e_1_3_2_1_41_1","unstructured":"Vasilis Syrgkanis and \u00c9va Tardos. 2013. Composable and efficient mechanisms . In Proc. ACM STOC 2013 . 211\u2013220. Vasilis Syrgkanis and \u00c9va Tardos. 2013. Composable and efficient mechanisms. In Proc. ACM STOC 2013. 211\u2013220."},{"key":"e_1_3_2_1_42_1","first-page":"92","article-title":"An n-to-1 bidder reduction for multi-item auctions and its applications","volume":"2015","author":"Chi-Chih Yao Andrew","year":"2015","unstructured":"Andrew Chi-Chih Yao . 2015 . An n-to-1 bidder reduction for multi-item auctions and its applications . In Proc. ACM-SIAM SODA 2015. 92 \u2013 109 . Andrew Chi-Chih Yao. 2015. An n-to-1 bidder reduction for multi-item auctions and its applications. In Proc. ACM-SIAM SODA 2015. 92\u2013109.","journal-title":"Proc. ACM-SIAM SODA"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Orlando FL USA","acronym":"STOC '23"},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T15:38:37Z","timestamp":1686584317000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":42,"alternative-id":["10.1145\/3564246.3585193","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585193","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}