{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:26:12Z","timestamp":1743031572580,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030676605"},{"type":"electronic","value":"9783030676612"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-67661-2_25","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T07:06:46Z","timestamp":1614150406000},"page":"416-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Low-Regret Algorithms for Strategic Buyers with Unknown Valuations in\u00a0Repeated Posted-Price Auctions"],"prefix":"10.1007","author":[{"given":"Jason","family":"Rhuggenaath","sequence":"first","affiliation":[]},{"given":"Paulo Roberto de","family":"Oliveira da Costa","sequence":"additional","affiliation":[]},{"given":"Yingqian","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Alp","family":"Akcay","sequence":"additional","affiliation":[]},{"given":"Uzay","family":"Kaymak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"25_CR1","unstructured":"Agrawal, S., Goyal, N.: Further optimal regret bounds for Thompson sampling. In: Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, vol. 31, pp. 99\u2013107. PMLR (2013)"},{"key":"25_CR2","unstructured":"Amin, K., Rostamizadeh, A., Syed, U.: Learning prices for repeated auctions with strategic buyers. In: Proceedings of the 26th International Conference on Neural Information Processing Systems, pp. 1169\u20131177. Curran Associates Inc. (2013)"},{"key":"25_CR3","first-page":"622","volume":"27","author":"K Amin","year":"2014","unstructured":"Amin, K., Rostamizadeh, A., Syed, U.: Repeated contextual auctions with strategic buyers. Adv. Neural Inf. Process. Syst. 27, 622\u2013630 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48\u201377 (2002)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002). https:\/\/doi.org\/10.1023\/A:1013689704352","journal-title":"Mach. Learn."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Kleinberg, R.D., Slivkins, A.: Truthful mechanisms with implicit payment computation. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 43\u201352. Association for Computing Machinery (2010)","DOI":"10.1145\/1807342.1807349"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/120878768","volume":"43","author":"M Babaioff","year":"2014","unstructured":"Babaioff, M., Sharma, Y., Slivkins, A.: Characterizing truthful multi-armed bandit mechanisms. SIAM J. Comput. 43(1), 194\u2013230 (2014)","journal-title":"SIAM J. Comput."},{"key":"25_CR8","unstructured":"Blum, A., Kumar, V., Rudra, A., Wu, F.: Online learning in online auctions. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 202\u2013204. SIAM (2003)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Braverman, M., Mao, J., Schneider, J., Weinberg, M.: Selling to a no-regret buyer. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 523\u2013538. ACM (2018)","DOI":"10.1145\/3219166.3219233"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck, S., Cesa-Bianchi, N.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends\u00ae Mach. Learn. 5(1), 1\u2013122 (2012)","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"25_CR11","first-page":"4803","volume":"32","author":"Y Deng","year":"2019","unstructured":"Deng, Y., Schneider, J., Sivan, B.: Prior-free dynamic auctions with low regret buyers. Adv. Neural Inf. Proces. Syst. 32, 4803\u20134813 (2019)","journal-title":"Adv. Neural Inf. Proces. Syst."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Kakade, S.M.: The price of truthfulness for pay-per-click auctions. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 99\u2013106 (2009)","DOI":"10.1145\/1566374.1566388"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Ding, W., Qiny, T., Zhang, X.D., Liu, T.Y.: Multi-armed bandit with budget constraint and variable costs. In: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, pp. 232\u2013238. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8637"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Drutsa, A.: Horizon-independent optimal pricing in repeated auctions with truthful and strategic buyers. In: Proceedings of the 26th International Conference on World Wide Web, pp. 33\u201342 (2017)","DOI":"10.1145\/3038912.3052700"},{"key":"25_CR15","unstructured":"Drutsa, A.: Weakly consistent optimal pricing algorithms in repeated posted-price auctions with strategic buyer. In: Proceedings of the 35th International Conference on Machine Learning, vol. 80, pp. 1319\u20131328. PMLR, 10\u201315 July 2018"},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.dss.2006.08.008","volume":"43","author":"B Edelman","year":"2007","unstructured":"Edelman, B., Ostrovsky, M.: Strategic bidder behavior in sponsored search auctions. Decis. Support Syst. 43(1), 192\u2013198 (2007)","journal-title":"Decis. Support Syst."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Feng, Z., Podimata, C., Syrgkanis, V.: Learning to bid without knowing your value. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 505\u2013522 (2018)","DOI":"10.1145\/3219166.3219208"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Gatti, N., Lazaric, A., Trov\u00f2, F.: A truthful learning mechanism for contextual multi-slot sponsored search auctions with externalities. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 605\u2013622. ACM (2012)","DOI":"10.1145\/2229012.2229057"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Lucier, B., Pountourakis, E., Taggart, S.: Repeated sales with multiple strategic buyers. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 167\u2013168 (2017)","DOI":"10.1145\/3033274.3085130"},{"key":"25_CR20","unstructured":"Kleinberg, R., Leighton, T.: The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 594 (2003)"},{"key":"25_CR21","unstructured":"Mohri, M., Medina, A.M.N.: Optimal regret minimization in posted-price auctions with strategic buyers. In: Proceedings of the 27th International Conference on Neural Information Processing Systems, pp. 1871\u20131879 (2014)"},{"issue":"1\u20132","key":"25_CR22","first-page":"1","volume":"12","author":"A Slivkins","year":"2019","unstructured":"Slivkins, A.: Introduction to multi-armed bandits. Found. Trends\u00ae Mach. Learn. 12(1\u20132), 1\u2013286 (2019)","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Tran-Thanh, L., Chapman, A., Rogers, A., Jennings, N.R.: Knapsack based optimal policies for budget-limited multi-armed bandits. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, pp. 1134\u20131140. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8279"},{"key":"25_CR24","unstructured":"Trov\u00f2, F., Paladino, S., Restelli, M., Gatti, N.: Budgeted multi-armed bandit in continuous action space. In: Proceedings of the Twenty-Second European Conference on Artificial Intelligence, pp. 560\u2013568. IOS Press (2016)"},{"key":"25_CR25","unstructured":"Vanunts, A., Drutsa, A.: Optimal pricing in repeated posted-price auctions with different patience of the seller and the buyer. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67661-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T23:03:03Z","timestamp":1740351783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67661-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030676605","9783030676612"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67661-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd2020.net\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"945","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":"195","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":"21% - 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":"4,5","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":"4,4","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":"No","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 took place virtually 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)"}}]}}