Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising

Simple item page
buir.contributor.authorDayanık, Savaş
dc.citation.epage56en_US
dc.citation.issueNumber1en_US
dc.citation.spage25en_US
dc.citation.volumeNumber97en_US
dc.contributor.authorDayanık, Savaş
dc.date.accessioned2023-02-16T13:40:05Z
dc.date.available2023-02-16T13:40:05Z
dc.date.issued2022-02
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractSponsored search advertisement allows advertisers to target their messages to appropriate customer segments at low costs. While search engines are interested in auction mechanisms that boost their revenues, advertisers seek optimal bidding strategies to increase their net sale revenues for multiple keywords under strict daily budget constraints in an environment where keyword query arrivals, competitor bid amounts, and user purchases are random. We focus on the advertiser’s question and formulate her optimal intraday dynamic multi-keyword bidding problem as a continuous-time stochastic optimization problem. We solve the problem, characterize an optimal policy, and bring a numerical algorithm for implementation. We also illustrate our optimal bidding policy and its benefits over heuristic solutions on numerical examples.en_US
dc.description.provenanceSubmitted by Evrim Ergin (eergin@bilkent.edu.tr) on 2023-02-16T13:40:05Z No. of bitstreams: 1 Optimal_dynamic_multi-keyword_bidding_policy_of_an_advertiser_in_search-based_advertising.pdf: 1057888 bytes, checksum: 24ba7f46f82e4110cfc0ed1f4c342e01 (MD5)en
dc.description.provenanceMade available in DSpace on 2023-02-16T13:40:05Z (GMT). No. of bitstreams: 1 Optimal_dynamic_multi-keyword_bidding_policy_of_an_advertiser_in_search-based_advertising.pdf: 1057888 bytes, checksum: 24ba7f46f82e4110cfc0ed1f4c342e01 (MD5) Previous issue date: 2022-02en
dc.identifier.doi10.1007/s00186-022-00803-yen_US
dc.identifier.issn1432-2994
dc.identifier.urihttp://hdl.handle.net/11693/111469
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttps://doi.org/10.1007/s00186-022-00803-yen_US
dc.source.titleMathematical Methods of Operations Researchen_US
dc.subjectDynamic biddingen_US
dc.subjectDynamic programmingen_US
dc.subjectSponsored search advertisingen_US
dc.subjectStochastic modelingen_US
dc.titleOptimal dynamic multi-keyword bidding policy of an advertiser in search-based advertisingen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Optimal_dynamic_multi-keyword_bidding_policy_of_an_advertiser_in_search-based_advertising.pdf
Size:
994.83 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Department of Industrial Engineering