{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:26:44Z","timestamp":1742930804587,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030946753"},{"type":"electronic","value":"9783030946760"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94676-0_18","type":"book-chapter","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T16:03:08Z","timestamp":1642694588000},"page":"317-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Platform Design Problem"],"prefix":"10.1007","author":[{"given":"Christos","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiran","family":"Vodrahalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal, A., Dahleh, M., Sarkar, T.: A marketplace for data: an algorithmic solution. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, pp. 701\u2013726. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3328526.3329589","DOI":"10.1145\/3328526.3329589"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Arrow, K.J., Block, H.D., Hurwicz, L.: On the stability of the competitive equilibrium, ii. Econometrica 27(1), 82\u2013109 (1959), http:\/\/www.jstor.org\/stable\/1907779","DOI":"10.2307\/1907779"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Balkanski, E., Rubinstein, A., Singer, Y.: The limitations of optimization from samples. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 1016\u20131027. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3055399.3055406","DOI":"10.1145\/3055399.3055406"},{"key":"18_CR4","unstructured":"Balkanski, E., Singer, Y.: The sample complexity of optimizing a convex function. In: Kale, S., Shamir, O. (eds.) Proceedings of the 2017 Conference on Learning Theory. Proceedings of Machine Learning Research, vol. 65, pp. 275\u2013301. PMLR, Amsterdam, 07\u201310 July 2017. http:\/\/proceedings.mlr.press\/v65\/balkanski17a.html"},{"key":"18_CR5","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. I, 4th edn.. Athena Scientific, Belmont (2017)"},{"key":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, New York (2006)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 214\u2013226 (2012)","DOI":"10.1145\/2090236.2090255"},{"key":"18_CR8","unstructured":"Foster, D.J., Li, Z., Lykouris, T., Sridharan, K., Tardos, E.: Learning in games: robustness of fast convergence. In: Advances in Neural Information Processing Systems, pp. 4734\u20134742 (2016)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Frazier, P., Kempe, D., Kleinberg, J., Kleinberg, R.: Incentivizing exploration. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 5\u201322 (2014)","DOI":"10.1145\/2600057.2602897"},{"key":"18_CR10","unstructured":"Gemici, K., Koutsoupias, E., Monnot, B., Papadimitriou, C., Piliouras, G.: Wealth inequality and the price of anarchy (2018)"},{"key":"18_CR11","unstructured":"Haghtalab, N.: Foundation of machine learning, by the people, for the People. Ph.D. thesis, Carnegie Mellon University (2018). http:\/\/reports-archive.adm.cs.cmu.edu\/anon\/anon\/usr0\/ftp\/usr\/ftp\/2018\/CMU-CS-18-114.pdf"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463\u2013468 (1975)","DOI":"10.1145\/321906.321909"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: A microeconomic view of data mining. Data Min. Knowl. Discov. 2(4), 311\u2013324 (1998)","DOI":"10.1023\/A:1009726428407"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation problems. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 473\u2013482. Association for Computing Machinery, New York (1998). https:\/\/doi.org\/10.1145\/276698.276860","DOI":"10.1145\/276698.276860"},{"key":"18_CR15","unstructured":"Kleinberg, J., Papadimitriou, C.H., Raghavan, P.: On the value of private information. In: Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2001, pp. 249\u2013257. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"key":"18_CR16","unstructured":"Liu, Y., Ho, C.: Incentivizing high quality user contributions: new arm generation in bandit learning. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), New Orleans, Louisiana, USA, 2\u20137, February 2018, pp. 1146\u20131153. AAAI Press (2018). https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/16879"},{"key":"18_CR17","unstructured":"Lykouris, T., Tardos, E., Wali, D.: Feedback graph regret bounds for thompson sampling and ucb (2019)"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Mansour, Y., Slivkins, A., Syrgkanis, V.: Bayesian incentive-compatible bandit exploration. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC 2015, pp. 565\u2013582. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2764468.2764508","DOI":"10.1145\/2764468.2764508"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Myerson, R.B.: Mechanism design by an informed principal. Econometrica J. Econ. Soc. 51, 1767\u20131797 (1983)","DOI":"10.2307\/1912116"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Vodrahalli, K., Yannakakis, M.: The platform design problem (2021)","DOI":"10.1007\/978-3-030-94676-0_18"},{"key":"18_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edn. John Wiley & Sons Inc, USA (1994)","edition":"1"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Roughgarden, T., Wang, J.R.: Minimizing regret with multiple reserves. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, pp. 601\u2013616. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2940716.2940792","DOI":"10.1145\/2940716.2940792"},{"issue":"2","key":"18_CR23","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1287\/opre.2017.1682","volume":"66","author":"JN Tsitsiklis","year":"2018","unstructured":"Tsitsiklis, J.N., Xu, K.: Delay-predictability trade-offs in reaching a secret goal. Oper. Res. 66(2), 587\u2013596 (2018). https:\/\/doi.org\/10.1287\/opre.2017.1682","journal-title":"Oper. Res."},{"key":"18_CR24","unstructured":"Tsitsiklis, J.N., Xu, K., Xu, Z.: Private sequential learning (2018)"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Vazirani, V.V.: Combinatorial Algorithms for Market Equilibria, pp. 103\u2013134. Cambridge University Press, Cambridge (2007). https:\/\/doi.org\/10.1017\/CBO9780511800481.007","DOI":"10.1017\/CBO9780511800481.007"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-35311-6_9","volume-title":"Internet and Network Economics","author":"M Zadimoghaddam","year":"2012","unstructured":"Zadimoghaddam, M., Roth, A.: Efficiently Learning from Revealed Preference. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 114\u2013127. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35311-6_9"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94676-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T21:26:58Z","timestamp":1651181218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94676-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030946753","9783030946760"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94676-0_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":"20 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpi.de\/wine2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"41","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":"11","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":"28% - 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.07","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":"7","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)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}