{"doi":"10.1145/2818357","author":[{"first_name":"Riccardo","full_name":"Colini-Baldeschi, Riccardo","last_name":"Colini-Baldeschi"},{"full_name":"Leonardi, Stefano","first_name":"Stefano","last_name":"Leonardi"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Martin","full_name":"Starnberger, Martin","last_name":"Starnberger"}],"_id":"11668","publication_status":"published","publication":"ACM Transactions on Economics and Computation","abstract":[{"text":"We study multiple keyword sponsored search auctions with budgets. Each keyword has multiple ad slots with a click-through rate. The bidders have additive valuations, which are linear in the click-through rates, and budgets, which are restricting their overall payments. Additionally, the number of slots per keyword assigned to a bidder is bounded.\r\n\r\nWe show the following results: (1) We give the first mechanism for multiple keywords, where click-through rates differ among slots. Our mechanism is incentive compatible in expectation, individually rational in expectation, and Pareto optimal. (2) We study the combinatorial setting, where each bidder is only interested in a subset of the keywords. We give an incentive compatible, individually rational, Pareto-optimal, and deterministic mechanism for identical click-through rates. (3) We give an impossibility result for incentive compatible, individually rational, Pareto-optimal, and deterministic mechanisms for bidders with diminishing marginal valuations.","lang":"eng"}],"article_number":"2","volume":4,"date_updated":"2023-02-09T10:03:35Z","type":"journal_article","extern":"1","publication_identifier":{"issn":["2167-8375"],"eissn":["2167-8383"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"article_processing_charge":"No","citation":{"ieee":"R. Colini-Baldeschi, S. Leonardi, M. H. Henzinger, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” <i>ACM Transactions on Economics and Computation</i>, vol. 4, no. 1. Association for Computing Machinery, 2015.","ama":"Colini-Baldeschi R, Leonardi S, Henzinger MH, Starnberger M. On multiple keyword sponsored search auctions with budgets. <i>ACM Transactions on Economics and Computation</i>. 2015;4(1). doi:<a href=\"https://doi.org/10.1145/2818357\">10.1145/2818357</a>","mla":"Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.” <i>ACM Transactions on Economics and Computation</i>, vol. 4, no. 1, 2, Association for Computing Machinery, 2015, doi:<a href=\"https://doi.org/10.1145/2818357\">10.1145/2818357</a>.","short":"R. Colini-Baldeschi, S. Leonardi, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 4 (2015).","apa":"Colini-Baldeschi, R., Leonardi, S., Henzinger, M. H., &#38; Starnberger, M. (2015). On multiple keyword sponsored search auctions with budgets. <i>ACM Transactions on Economics and Computation</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2818357\">https://doi.org/10.1145/2818357</a>","chicago":"Colini-Baldeschi, Riccardo, Stefano Leonardi, Monika H Henzinger, and Martin Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” <i>ACM Transactions on Economics and Computation</i>. Association for Computing Machinery, 2015. <a href=\"https://doi.org/10.1145/2818357\">https://doi.org/10.1145/2818357</a>.","ista":"Colini-Baldeschi R, Leonardi S, Henzinger MH, Starnberger M. 2015. On multiple keyword sponsored search auctions with budgets. ACM Transactions on Economics and Computation. 4(1), 2."},"date_created":"2022-07-27T11:54:56Z","month":"12","main_file_link":[{"open_access":"1","url":"http://eprints.cs.univie.ac.at/3510/"}],"title":"On multiple keyword sponsored search auctions with budgets","scopus_import":"1","quality_controlled":"1","issue":"1","oa_version":"Submitted Version","intvolume":"         4","language":[{"iso":"eng"}],"article_type":"original","publisher":"Association for Computing Machinery","year":"2015","day":"05","date_published":"2015-12-05T00:00:00Z","keyword":["Algorithms","Economics","Clinching ascending auction","auctions with budgets","Sponsored search auctions"]}