{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T17:27:09Z","timestamp":1776446829494,"version":"3.51.2"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2021,2]]},"abstract":"<jats:p>\n            Data-driven machine learning has become ubiquitous. A marketplace for machine learning models connects data owners and model buyers, and can dramatically facilitate data-driven machine learning applications. In this paper, we take a formal data marketplace perspective and propose the first en&lt;u&gt;\n            <jats:bold>D<\/jats:bold>\n            &lt;\/u&gt;-to-end mod\n            <jats:bold>&lt;u&gt;e&lt;\/u&gt;<\/jats:bold>\n            l m\n            <jats:bold>&lt;u&gt;a&lt;\/u&gt;<\/jats:bold>\n            rketp\n            <jats:bold>&lt;u&gt;l&lt;\/u&gt;<\/jats:bold>\n            ace with diff\n            <jats:bold>&lt;u&gt;e&lt;\/u&gt;<\/jats:bold>\n            rential p\n            <jats:bold>&lt;u&gt;r&lt;\/u&gt;<\/jats:bold>\n            ivacy (\n            <jats:italic>Dealer<\/jats:italic>\n            ) towards answering the following questions:\n            <jats:italic>How to formulate data owners' compensation functions and model buyers' price functions? How can the broker determine prices for a set of models to maximize the revenue with arbitrage-free guarantee, and train a set of models with maximum Shapley coverage given a manufacturing budget to remain competitive<\/jats:italic>\n            ? For the former, we propose compensation function for each data owner based on Shapley value and privacy sensitivity, and price function for each model buyer based on Shapley coverage sensitivity and noise sensitivity. Both privacy sensitivity and noise sensitivity are measured by the level of differential privacy. For the latter, we formulate two optimization problems for model pricing and model training, and propose efficient dynamic programming algorithms. Experiment results on the real chess dataset and synthetic datasets justify the design of\n            <jats:italic>Dealer<\/jats:italic>\n            and verify the efficiency and effectiveness of the proposed algorithms.\n          <\/jats:p>","DOI":"10.14778\/3447689.3447700","type":"journal-article","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T16:20:06Z","timestamp":1618244406000},"page":"957-969","source":"Crossref","is-referenced-by-count":76,"title":["Dealer"],"prefix":"10.14778","volume":"14","author":[{"given":"Jinfei","family":"Liu","sequence":"first","affiliation":[{"name":"Zhejiang University"}]},{"given":"Jian","family":"Lou","sequence":"additional","affiliation":[{"name":"Emory University"}]},{"given":"Junxu","family":"Liu","sequence":"additional","affiliation":[{"name":"Renmin University of China"}]},{"given":"Li","family":"Xiong","sequence":"additional","affiliation":[{"name":"Emory University"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}]},{"given":"Jimeng","family":"Sun","sequence":"additional","affiliation":[{"name":"UIUC"}]}],"member":"320","published-online":{"date-parts":[[2021,4,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Dawex https:\/\/www.dawex.com\/en\/.  Dawex https:\/\/www.dawex.com\/en\/."},{"key":"e_1_2_1_2_1","unstructured":"Google bigquery https:\/\/cloud.google.com\/bigquery\/.  Google bigquery https:\/\/cloud.google.com\/bigquery\/."},{"key":"e_1_2_1_3_1","unstructured":"https:\/\/support.gnip.com\/apis\/.  https:\/\/support.gnip.com\/apis\/."},{"key":"e_1_2_1_4_1","unstructured":"https:\/\/www.bloomberg.com\/professional\/product\/market-data\/.  https:\/\/www.bloomberg.com\/professional\/product\/market-data\/."},{"key":"e_1_2_1_5_1","unstructured":"Iota https:\/\/data.iota.org\/.  Iota https:\/\/data.iota.org\/."},{"key":"e_1_2_1_6_1","unstructured":"Safegraph https:\/\/www.safegraph.com\/.  Safegraph https:\/\/www.safegraph.com\/."},{"key":"e_1_2_1_7_1","unstructured":"Technical report https:\/\/github.com\/emory-aims\/publications\/blob\/master\/projectdealer.pdf\/.  Technical report https:\/\/github.com\/emory-aims\/publications\/blob\/master\/projectdealer.pdf\/."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329589"},{"key":"e_1_2_1_9_1","first-page":"272","volume-title":"ICML","author":"Ancona M.","year":"2019","unstructured":"M. Ancona , C. \u00d6ztireli , and M. H. Gross . Explaining deep neural networks with a polynomial time algorithm for shapley value approximation . In ICML , pages 272 -- 281 , 2019 . M. Ancona, C. \u00d6ztireli, and M. H. Gross. Explaining deep neural networks with a polynomial time algorithm for shapley value approximation. In ICML, pages 272--281, 2019."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.04.004"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(03)00136-5"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021036"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3357377.3357378"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300078"},{"key":"e_1_2_1_15_1","volume-title":"UCI machine learning repository","author":"Dua D.","year":"2017","unstructured":"D. Dua and C. Graff . UCI machine learning repository , 2017 . D. Dua and C. Graff. UCI machine learning repository, 2017."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.05.003"},{"key":"e_1_2_1_19_1","first-page":"2242","volume-title":"ICML","author":"Ghorbani A.","year":"2019","unstructured":"A. Ghorbani and J. Y. Zou . Data shapley: Equitable valuation of data for machine learning . In ICML , pages 2242 -- 2251 , 2019 . A. Ghorbani and J. Y. Zou. Data shapley: Equitable valuation of data for machine learning. In ICML, pages 2242--2251, 2019."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993605"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070598"},{"key":"e_1_2_1_22_1","volume-title":"Towards practical differentially private convex optimization","author":"Iyengar R.","unstructured":"R. Iyengar , J. P. Near , D. Song , O. Thakkar , A. Thakurta , and L. Wang . Towards practical differentially private convex optimization . In IEEE S and P. R. Iyengar, J. P. Near, D. Song, O. Thakkar, A. Thakurta, and L. Wang. Towards practical differentially private convex optimization. In IEEE S and P."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342637"},{"key":"e_1_2_1_24_1","volume-title":"Advances and open problems in federated learning. CoRR, abs\/1912.04977","author":"Kairouz P.","year":"2019","unstructured":"P. Kairouz , H. B. McMahan , B. Avent , A. Bellet , M. Bennis , A. N. Bhagoji , K. Bonawitz , Z. Charles , G. Cormode , R. Cummings , R. G. L. D'Oliveira , S. E. Rouayheb , D. Evans , J. Gardner , Z. Garrett , A. Gasc\u00f3n , B. Ghazi , P. B. Gibbons , M. Gruteser , Z. Harchaoui , C. He , L. He , Z. Huo , B. Hutchinson , J. Hsu , M. Jaggi , T. Javidi , G. Joshi , M. Khodak , J. Konecn\u00fd , A. Korolova , F. Koushanfar , S. Koyejo , T. Lepoint , Y. Liu , P. Mittal , M. Mohri , R. Nock , A. \u00d6zg\u00fcr , R. Pagh , M. Raykova , H. Qi , D. Ramage , R. Raskar , D. Song , W. Song , S. U. Stich , Z. Sun , A. T. Suresh , F. Tram\u00e8r , P. Vepakomma , J. Wang , L. Xiong , Z. Xu , Q. Yang , F. X. Yu , H. Yu , and S. Zhao . Advances and open problems in federated learning. CoRR, abs\/1912.04977 , 2019 . P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, K. Bonawitz, Z. Charles, G. Cormode, R. Cummings, R. G. L. D'Oliveira, S. E. Rouayheb, D. Evans, J. Gardner, Z. Garrett, A. Gasc\u00f3n, B. Ghazi, P. B. Gibbons, M. Gruteser, Z. Harchaoui, C. He, L. He, Z. Huo, B. Hutchinson, J. Hsu, M. Jaggi, T. Javidi, G. Joshi, M. Khodak, J. Konecn\u00fd, A. Korolova, F. Koushanfar, S. Koyejo, T. Lepoint, Y. Liu, P. Mittal, M. Mohri, R. Nock, A. \u00d6zg\u00fcr, R. Pagh, M. Raykova, H. Qi, D. Ramage, R. Raskar, D. Song, W. Song, S. U. Stich, Z. Sun, A. T. Suresh, F. Tram\u00e8r, P. Vepakomma, J. Wang, L. Xiong, Z. Xu, Q. Yang, F. X. Yu, H. Yu, and S. Zhao. Advances and open problems in federated learning. CoRR, abs\/1912.04977, 2019."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00086-1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213582"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465335"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2770870"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448502"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2691190.2691191"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139457"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732948"},{"key":"e_1_2_1_33_1","article-title":"A survey on data pricing: from economics to data science","author":"Pei J.","year":"2021","unstructured":"J. Pei . A survey on data pricing: from economics to data science . IEEE Trans. Knowl. Data Eng. , 2021 . J. Pei. A survey on data pricing: from economics to data science. IEEE Trans. Knowl. Data Eng., 2021.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"e_1_2_1_34_1","first-page":"107","article-title":"Versioning: The smart way to sell information","volume":"76","author":"Shapiro C.","year":"1998","unstructured":"C. Shapiro and H. Varian . Versioning: The smart way to sell information . Harvard Business Review , 76 ( 6 ): 107 -- 115 , 1998 . C. Shapiro and H. Varian. Versioning: The smart way to sell information. Harvard Business Review, 76(6):107--115, 1998.","journal-title":"Harvard Business Review"},{"key":"e_1_2_1_35_1","volume-title":"Contributions to the Theory of Games, 2(28):307--317","author":"Shapley L. S.","year":"1953","unstructured":"L. S. Shapley . A value for n-person games. Contributions to the Theory of Games, 2(28):307--317 , 1953 . L. S. Shapley. A value for n-person games. Contributions to the Theory of Games, 2(28):307--317, 1953."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319891"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3447689.3447700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:18:31Z","timestamp":1672226311000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3447689.3447700"}},"subtitle":["an end-to-end model marketplace with differential privacy"],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["10.14778\/3447689.3447700"],"URL":"https:\/\/doi.org\/10.14778\/3447689.3447700","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2021,2]]}}}