{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:36:43Z","timestamp":1743086203774,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_18","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"248-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Mechanism Design Approach for Multi-party Machine Learning"],"prefix":"10.1007","author":[{"given":"Mengjing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiran","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiheng","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pingzhong","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., et al.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 308\u2013318. ACM (2016)","DOI":"10.1145\/2976749.2978318"},{"issue":"5","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"LM Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. Am. Econ. Rev. 94(5), 1452\u20131475 (2004)","journal-title":"Am. Econ. Rev."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Feldman, M.: Implementation with a bounded action space. In: Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 62\u201371. ACM (2006)","DOI":"10.1145\/1134707.1134715"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N.: Auctions with severely bounded communication. In: 2002 Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 406\u2013415. IEEE (2002)","DOI":"10.1109\/SFCS.2002.1181965"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Chawla, S., Fu, H., Karlin, A.R.: Approximate revenue maximization in interdependent value settings. In: Babaioff, M., Conitzer, V., Easley, D.A. (eds.) ACM Conference on Economics and Computation, EC 2014, Stanford, CA, USA, 8\u201312 June 2014, pp. 277\u2013294. ACM (2014)","DOI":"10.1145\/2600057.2602858"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0165-1765(89)90019-0","volume":"31","author":"MSY Chwe","year":"1989","unstructured":"Chwe, M.S.Y.: The discrete bid first auction. Econ. Lett. 31(4), 303\u2013306 (1989)","journal-title":"Econ. Lett."},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1239971.1239976","volume":"7","author":"E David","year":"2007","unstructured":"David, E., Rogers, A., Jennings, N.R., Schiff, J., Kraus, S., Rothkopf, M.H.: Optimal design of English auctions with discrete bid levels. ACM Trans. Internet Technol. (TOIT) 7(2), 12 (2007)","journal-title":"ACM Trans. Internet Technol. (TOIT)"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/JSAC.2020.3036944","volume":"39","author":"N Ding","year":"2020","unstructured":"Ding, N., Fang, Z., Huang, J.: Optimal contract design for efficient federated learning with multi-dimensional private information. IEEE J. Sel. Areas Commun. 39(1), 186\u2013200 (2020)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"18_CR9","unstructured":"Fang, W., Tang, P., Zuo, S.: Digital good exchange. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 1277\u20131278. International Foundation for Autonomous Agents and Multiagent Systems (2016)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Hartline, J.D.: Envy-free auctions for digital goods. In: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 29\u201335. ACM (2003)","DOI":"10.1145\/779928.779932"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 735\u2013744. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1007\/3-540-44676-1_35"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Hu, Y., Niu, D., Yang, J., Zhou, S.: FDML: a collaborative machine learning framework for distributed features. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2232\u20132240. ACM (2019)","DOI":"10.1145\/3292500.3330765"},{"key":"18_CR13","unstructured":"Jia, R., et al.: Towards efficient data valuation based on the Shapley value. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 1167\u20131176. PMLR (2019)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Kang, J., Xiong, Z., Niyato, D., Yu, H., Liang, Y.C., Kim, D.I.: Incentive design for efficient federated learning in mobile networks: a contract theory approach. arXiv preprint arXiv:1905.07479 (2019)","DOI":"10.1109\/VTS-APWCS.2019.8851649"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"2031","DOI":"10.1109\/COMST.2020.2986024","volume":"22","author":"WYB Lim","year":"2020","unstructured":"Lim, W.Y.B., et al.: Federated learning in mobile edge networks: a comprehensive survey. IEEE Commun. Surv. Tutor. 22(3), 2031\u20132063 (2020)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"18_CR16","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial Intelligence and Statistics, pp. 1273\u20131282 (2017)"},{"issue":"5","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1111\/j.1468-0262.2004.00546.x","volume":"72","author":"C Mezzetti","year":"2004","unstructured":"Mezzetti, C.: Mechanism design with interdependent valuations: efficiency. Econometrica 72(5), 1617\u20131626 (2004)","journal-title":"Econometrica"},{"issue":"5","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.2307\/1911865","volume":"50","author":"PR Milgrom","year":"1982","unstructured":"Milgrom, P.R., Weber, R.J.: A theory of auctions and competitive bidding. Econometrica 50(5), 1089\u20131122 (1982)","journal-title":"Econometrica"},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"29","author":"RB Myerson","year":"1983","unstructured":"Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theory 29(2), 265\u2013281 (1983)","journal-title":"J. Econ. Theory"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Redko, I., Laclau, C.: On fair cost sharing games in machine learning. In: Thirty-Third AAAI Conference on Artificial Intelligence (2019)","DOI":"10.1609\/aaai.v33i01.33014790"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Talgam-Cohen, I.: Optimal and robust mechanism design with interdependent values. ACM Trans. Econ. Comput. 4(3), 18:1\u201318:34 (2016)","DOI":"10.1145\/2910577"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Shokri, R., Shmatikov, V.: Privacy-preserving deep learning. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 1310\u20131321. ACM (2015)","DOI":"10.1145\/2810103.2813687"},{"key":"18_CR23","unstructured":"Smith, V., Chiang, C.K., Sanjabi, M., Talwalkar, A.S.: Federated multi-task learning. In: Advances in Neural Information Processing Systems, pp. 4424\u20134434 (2017)"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Song, T., Tong, Y., Wei, S.: Profit allocation for federated learning. In: 2019 IEEE International Conference on Big Data (Big Data), pp. 2577\u20132586. IEEE (2019)","DOI":"10.1109\/BigData47090.2019.9006327"},{"key":"18_CR25","unstructured":"Takabi, H., Hesamifard, E., Ghasemi, M.: Privacy preserving multi-party machine learning with homomorphic encryption. In: 29th Annual Conference on Neural Information Processing Systems (NIPS) (2016)"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Yonetani, R., Naresh Boddeti, V., Kitani, K.M., Sato, Y.: Privacy-preserving visual learning using doubly permuted homomorphic encryption. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 2040\u20132050 (2017)","DOI":"10.1109\/ICCV.2017.225"},{"key":"18_CR27","first-page":"1035","volume":"10","author":"Y Zhan","year":"2021","unstructured":"Zhan, Y., Zhang, J., Hong, Z., Wu, L., Li, P., Guo, S.: A survey of incentive mechanism design for federated learning. IEEE Trans. Emerg. Top. Comput. 10, 1035\u20131044 (2021)","journal-title":"IEEE Trans. Emerg. Top. Comput."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T10:23:20Z","timestamp":1728642200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}