Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice

Online advertising channels have commonly focused on maximizing total advertiser value (or welfare) to enhance long-run retention and channel healthiness. Previous literature has studied auction design by incorporating machine learning predictions on advertiser values (also known as machine-learned...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Deng, Yuan, Golrezaei, Negin, Jaillet, Patrick, Liang, Jason Cheuk Nam, Mirrokni, Vahab
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Deng, Yuan
Golrezaei, Negin
Jaillet, Patrick
Liang, Jason Cheuk Nam
Mirrokni, Vahab
description Online advertising channels have commonly focused on maximizing total advertiser value (or welfare) to enhance long-run retention and channel healthiness. Previous literature has studied auction design by incorporating machine learning predictions on advertiser values (also known as machine-learned advice) through various forms to improve total welfare. Yet, such improvements could come at the cost of individual bidders' welfare and do not shed light on how particular advertiser bidding strategies impact welfare. Motivated by this, we present an analysis on an individual bidder's welfare loss in the autobidding world for auctions with and without machine-learned advice, and also uncover how advertiser strategies relate to such losses. In particular, we demonstrate how ad platforms can utilize ML advice to improve welfare guarantee on the aggregate and individual bidder level by setting ML advice as personalized reserve prices when the platform consists of autobidders who maximize value while respecting a return-on-ad spent (ROAS) constraint. Under parallel VCG auctions with such ML advice-based reserves, we present a worst-case welfare lower-bound guarantee for an individual autobidder, and show that the lower-bound guarantee is positively correlated with ML advice quality as well the scale of bids induced by the autobidder's bidding strategies. Further, we prove an impossibility result showing that no truthful, and possibly randomized mechanism with anonymous allocations can achieve universally better individual welfare guarantees than VCG, in presence of personalized reserves based on ML-advice of equal quality. Moreover, we extend our individual welfare guarantee results to generalized first price (GFP) and generalized second price (GSP) auctions.
doi_str_mv 10.48550/arxiv.2209.04748
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2209_04748</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2209_04748</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-e4bdfc232137e7dceeb6c7e53b595167624a2469b11c220d52eddc83a44cead03</originalsourceid><addsrcrecordid>eNotz71OwzAUhmEvDKhwAUz4BhIS_yZjVEGpVISEKnWMjn1OiCXjIjcJcPdAYfq2V9_D2E1dlarRurqD_BmWUoiqLStlVXPJXrYJwxJwhsgPFAfIxDczZEgT0YmHxKeReDdPRxcQQ3rlh2OOyD_CNPIn8GNIVESCnAh5h0vwdMUuBognuv7fFds_3O_Xj8XuebNdd7sCjG0KUg4HL6SopSWLnsgZb0lLp1tdG2uEAqFM6-ra_xxGLQjRNxKU8gRYyRW7_cueUf17Dm-Qv_pfXH_GyW8N8kqy</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice</title><source>arXiv.org</source><creator>Deng, Yuan ; Golrezaei, Negin ; Jaillet, Patrick ; Liang, Jason Cheuk Nam ; Mirrokni, Vahab</creator><creatorcontrib>Deng, Yuan ; Golrezaei, Negin ; Jaillet, Patrick ; Liang, Jason Cheuk Nam ; Mirrokni, Vahab</creatorcontrib><description>Online advertising channels have commonly focused on maximizing total advertiser value (or welfare) to enhance long-run retention and channel healthiness. Previous literature has studied auction design by incorporating machine learning predictions on advertiser values (also known as machine-learned advice) through various forms to improve total welfare. Yet, such improvements could come at the cost of individual bidders' welfare and do not shed light on how particular advertiser bidding strategies impact welfare. Motivated by this, we present an analysis on an individual bidder's welfare loss in the autobidding world for auctions with and without machine-learned advice, and also uncover how advertiser strategies relate to such losses. In particular, we demonstrate how ad platforms can utilize ML advice to improve welfare guarantee on the aggregate and individual bidder level by setting ML advice as personalized reserve prices when the platform consists of autobidders who maximize value while respecting a return-on-ad spent (ROAS) constraint. Under parallel VCG auctions with such ML advice-based reserves, we present a worst-case welfare lower-bound guarantee for an individual autobidder, and show that the lower-bound guarantee is positively correlated with ML advice quality as well the scale of bids induced by the autobidder's bidding strategies. Further, we prove an impossibility result showing that no truthful, and possibly randomized mechanism with anonymous allocations can achieve universally better individual welfare guarantees than VCG, in presence of personalized reserves based on ML-advice of equal quality. Moreover, we extend our individual welfare guarantee results to generalized first price (GFP) and generalized second price (GSP) auctions.</description><identifier>DOI: 10.48550/arxiv.2209.04748</identifier><language>eng</language><subject>Computer Science - Computer Science and Game Theory</subject><creationdate>2022-09</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2209.04748$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2209.04748$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Deng, Yuan</creatorcontrib><creatorcontrib>Golrezaei, Negin</creatorcontrib><creatorcontrib>Jaillet, Patrick</creatorcontrib><creatorcontrib>Liang, Jason Cheuk Nam</creatorcontrib><creatorcontrib>Mirrokni, Vahab</creatorcontrib><title>Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice</title><description>Online advertising channels have commonly focused on maximizing total advertiser value (or welfare) to enhance long-run retention and channel healthiness. Previous literature has studied auction design by incorporating machine learning predictions on advertiser values (also known as machine-learned advice) through various forms to improve total welfare. Yet, such improvements could come at the cost of individual bidders' welfare and do not shed light on how particular advertiser bidding strategies impact welfare. Motivated by this, we present an analysis on an individual bidder's welfare loss in the autobidding world for auctions with and without machine-learned advice, and also uncover how advertiser strategies relate to such losses. In particular, we demonstrate how ad platforms can utilize ML advice to improve welfare guarantee on the aggregate and individual bidder level by setting ML advice as personalized reserve prices when the platform consists of autobidders who maximize value while respecting a return-on-ad spent (ROAS) constraint. Under parallel VCG auctions with such ML advice-based reserves, we present a worst-case welfare lower-bound guarantee for an individual autobidder, and show that the lower-bound guarantee is positively correlated with ML advice quality as well the scale of bids induced by the autobidder's bidding strategies. Further, we prove an impossibility result showing that no truthful, and possibly randomized mechanism with anonymous allocations can achieve universally better individual welfare guarantees than VCG, in presence of personalized reserves based on ML-advice of equal quality. Moreover, we extend our individual welfare guarantee results to generalized first price (GFP) and generalized second price (GSP) auctions.</description><subject>Computer Science - Computer Science and Game Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAUhmEvDKhwAUz4BhIS_yZjVEGpVISEKnWMjn1OiCXjIjcJcPdAYfq2V9_D2E1dlarRurqD_BmWUoiqLStlVXPJXrYJwxJwhsgPFAfIxDczZEgT0YmHxKeReDdPRxcQQ3rlh2OOyD_CNPIn8GNIVESCnAh5h0vwdMUuBognuv7fFds_3O_Xj8XuebNdd7sCjG0KUg4HL6SopSWLnsgZb0lLp1tdG2uEAqFM6-ra_xxGLQjRNxKU8gRYyRW7_cueUf17Dm-Qv_pfXH_GyW8N8kqy</recordid><startdate>20220910</startdate><enddate>20220910</enddate><creator>Deng, Yuan</creator><creator>Golrezaei, Negin</creator><creator>Jaillet, Patrick</creator><creator>Liang, Jason Cheuk Nam</creator><creator>Mirrokni, Vahab</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220910</creationdate><title>Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice</title><author>Deng, Yuan ; Golrezaei, Negin ; Jaillet, Patrick ; Liang, Jason Cheuk Nam ; Mirrokni, Vahab</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-e4bdfc232137e7dceeb6c7e53b595167624a2469b11c220d52eddc83a44cead03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Computer Science and Game Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Deng, Yuan</creatorcontrib><creatorcontrib>Golrezaei, Negin</creatorcontrib><creatorcontrib>Jaillet, Patrick</creatorcontrib><creatorcontrib>Liang, Jason Cheuk Nam</creatorcontrib><creatorcontrib>Mirrokni, Vahab</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Deng, Yuan</au><au>Golrezaei, Negin</au><au>Jaillet, Patrick</au><au>Liang, Jason Cheuk Nam</au><au>Mirrokni, Vahab</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice</atitle><date>2022-09-10</date><risdate>2022</risdate><abstract>Online advertising channels have commonly focused on maximizing total advertiser value (or welfare) to enhance long-run retention and channel healthiness. Previous literature has studied auction design by incorporating machine learning predictions on advertiser values (also known as machine-learned advice) through various forms to improve total welfare. Yet, such improvements could come at the cost of individual bidders' welfare and do not shed light on how particular advertiser bidding strategies impact welfare. Motivated by this, we present an analysis on an individual bidder's welfare loss in the autobidding world for auctions with and without machine-learned advice, and also uncover how advertiser strategies relate to such losses. In particular, we demonstrate how ad platforms can utilize ML advice to improve welfare guarantee on the aggregate and individual bidder level by setting ML advice as personalized reserve prices when the platform consists of autobidders who maximize value while respecting a return-on-ad spent (ROAS) constraint. Under parallel VCG auctions with such ML advice-based reserves, we present a worst-case welfare lower-bound guarantee for an individual autobidder, and show that the lower-bound guarantee is positively correlated with ML advice quality as well the scale of bids induced by the autobidder's bidding strategies. Further, we prove an impossibility result showing that no truthful, and possibly randomized mechanism with anonymous allocations can achieve universally better individual welfare guarantees than VCG, in presence of personalized reserves based on ML-advice of equal quality. Moreover, we extend our individual welfare guarantee results to generalized first price (GFP) and generalized second price (GSP) auctions.</abstract><doi>10.48550/arxiv.2209.04748</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2209.04748
ispartof
issn
language eng
recordid cdi_arxiv_primary_2209_04748
source arXiv.org
subjects Computer Science - Computer Science and Game Theory
title Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T11%3A23%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Individual%20Welfare%20Guarantees%20in%20the%20Autobidding%20World%20with%20Machine-learned%20Advice&rft.au=Deng,%20Yuan&rft.date=2022-09-10&rft_id=info:doi/10.48550/arxiv.2209.04748&rft_dat=%3Carxiv_GOX%3E2209_04748%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true