AD SERVING WITH MULTIPLE GOALS USING CONSTRAINT ERROR MINIMIZATION
The present disclosure describes a system that attempts to reconcile diverse goals and re-cast the goals into something that is quantifiable and optimizable. One way to reconcile diverse goals is by converting these "constraints"-with the huge problems of feasibility-into errors that can b...
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , |
|---|---|
| Format: | Patent |
| 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 | Yadav, Ishadulta Kitts, Brendan Zeng, Yongbo Krishnan, Michael Thornburg, Ethan James Badeau, Garrett James Potter, Andrew George Wei, Liang Chen, Ruofeng Tolkachov, Sergey |
| description | The present disclosure describes a system that attempts to reconcile diverse goals and re-cast the goals into something that is quantifiable and optimizable. One way to reconcile diverse goals is by converting these "constraints"-with the huge problems of feasibility-into errors that can be minimized. This disclosure also presents solutions for rate constraints which previously have not been dealt with. The resulting system enables advertisers to dynamically adjust their campaign based on the needs of the moment. Such a system can have advantages in terms of controllability, smoothness, as well as avoiding hard stop conditions that plague the constraint-based approach. In order to achieve this result, solutions are presented for problems of pacing, viewability prediction, and most particularly, error minimization. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2018108049A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2018108049A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2018108049A13</originalsourceid><addsrcrecordid>eNrjZHBydFEIdg0K8_RzVwj3DPFQ8A31CfEM8HFVcPd39AlWCA0GyTj7-wWHBDl6-oUouAYF-Qcp-Hr6efp6RjmGePr78TCwpiXmFKfyQmluBmU31xBnD93Ugvz41OKCxOTUvNSS-NBgIwNDC0MDCwMTS0dDY-JUAQDXQyyN</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>AD SERVING WITH MULTIPLE GOALS USING CONSTRAINT ERROR MINIMIZATION</title><source>esp@cenet</source><creator>Yadav, Ishadulta ; Kitts, Brendan ; Zeng, Yongbo ; Krishnan, Michael ; Thornburg, Ethan James ; Badeau, Garrett James ; Potter, Andrew George ; Wei, Liang ; Chen, Ruofeng ; Tolkachov, Sergey</creator><creatorcontrib>Yadav, Ishadulta ; Kitts, Brendan ; Zeng, Yongbo ; Krishnan, Michael ; Thornburg, Ethan James ; Badeau, Garrett James ; Potter, Andrew George ; Wei, Liang ; Chen, Ruofeng ; Tolkachov, Sergey</creatorcontrib><description>The present disclosure describes a system that attempts to reconcile diverse goals and re-cast the goals into something that is quantifiable and optimizable. One way to reconcile diverse goals is by converting these "constraints"-with the huge problems of feasibility-into errors that can be minimized. This disclosure also presents solutions for rate constraints which previously have not been dealt with. The resulting system enables advertisers to dynamically adjust their campaign based on the needs of the moment. Such a system can have advantages in terms of controllability, smoothness, as well as avoiding hard stop conditions that plague the constraint-based approach. In order to achieve this result, solutions are presented for problems of pacing, viewability prediction, and most particularly, error minimization.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2018</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20180419&DB=EPODOC&CC=US&NR=2018108049A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20180419&DB=EPODOC&CC=US&NR=2018108049A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Yadav, Ishadulta</creatorcontrib><creatorcontrib>Kitts, Brendan</creatorcontrib><creatorcontrib>Zeng, Yongbo</creatorcontrib><creatorcontrib>Krishnan, Michael</creatorcontrib><creatorcontrib>Thornburg, Ethan James</creatorcontrib><creatorcontrib>Badeau, Garrett James</creatorcontrib><creatorcontrib>Potter, Andrew George</creatorcontrib><creatorcontrib>Wei, Liang</creatorcontrib><creatorcontrib>Chen, Ruofeng</creatorcontrib><creatorcontrib>Tolkachov, Sergey</creatorcontrib><title>AD SERVING WITH MULTIPLE GOALS USING CONSTRAINT ERROR MINIMIZATION</title><description>The present disclosure describes a system that attempts to reconcile diverse goals and re-cast the goals into something that is quantifiable and optimizable. One way to reconcile diverse goals is by converting these "constraints"-with the huge problems of feasibility-into errors that can be minimized. This disclosure also presents solutions for rate constraints which previously have not been dealt with. The resulting system enables advertisers to dynamically adjust their campaign based on the needs of the moment. Such a system can have advantages in terms of controllability, smoothness, as well as avoiding hard stop conditions that plague the constraint-based approach. In order to achieve this result, solutions are presented for problems of pacing, viewability prediction, and most particularly, error minimization.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHBydFEIdg0K8_RzVwj3DPFQ8A31CfEM8HFVcPd39AlWCA0GyTj7-wWHBDl6-oUouAYF-Qcp-Hr6efp6RjmGePr78TCwpiXmFKfyQmluBmU31xBnD93Ugvz41OKCxOTUvNSS-NBgIwNDC0MDCwMTS0dDY-JUAQDXQyyN</recordid><startdate>20180419</startdate><enddate>20180419</enddate><creator>Yadav, Ishadulta</creator><creator>Kitts, Brendan</creator><creator>Zeng, Yongbo</creator><creator>Krishnan, Michael</creator><creator>Thornburg, Ethan James</creator><creator>Badeau, Garrett James</creator><creator>Potter, Andrew George</creator><creator>Wei, Liang</creator><creator>Chen, Ruofeng</creator><creator>Tolkachov, Sergey</creator><scope>EVB</scope></search><sort><creationdate>20180419</creationdate><title>AD SERVING WITH MULTIPLE GOALS USING CONSTRAINT ERROR MINIMIZATION</title><author>Yadav, Ishadulta ; Kitts, Brendan ; Zeng, Yongbo ; Krishnan, Michael ; Thornburg, Ethan James ; Badeau, Garrett James ; Potter, Andrew George ; Wei, Liang ; Chen, Ruofeng ; Tolkachov, Sergey</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2018108049A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2018</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>Yadav, Ishadulta</creatorcontrib><creatorcontrib>Kitts, Brendan</creatorcontrib><creatorcontrib>Zeng, Yongbo</creatorcontrib><creatorcontrib>Krishnan, Michael</creatorcontrib><creatorcontrib>Thornburg, Ethan James</creatorcontrib><creatorcontrib>Badeau, Garrett James</creatorcontrib><creatorcontrib>Potter, Andrew George</creatorcontrib><creatorcontrib>Wei, Liang</creatorcontrib><creatorcontrib>Chen, Ruofeng</creatorcontrib><creatorcontrib>Tolkachov, Sergey</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yadav, Ishadulta</au><au>Kitts, Brendan</au><au>Zeng, Yongbo</au><au>Krishnan, Michael</au><au>Thornburg, Ethan James</au><au>Badeau, Garrett James</au><au>Potter, Andrew George</au><au>Wei, Liang</au><au>Chen, Ruofeng</au><au>Tolkachov, Sergey</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>AD SERVING WITH MULTIPLE GOALS USING CONSTRAINT ERROR MINIMIZATION</title><date>2018-04-19</date><risdate>2018</risdate><abstract>The present disclosure describes a system that attempts to reconcile diverse goals and re-cast the goals into something that is quantifiable and optimizable. One way to reconcile diverse goals is by converting these "constraints"-with the huge problems of feasibility-into errors that can be minimized. This disclosure also presents solutions for rate constraints which previously have not been dealt with. The resulting system enables advertisers to dynamically adjust their campaign based on the needs of the moment. Such a system can have advantages in terms of controllability, smoothness, as well as avoiding hard stop conditions that plague the constraint-based approach. In order to achieve this result, solutions are presented for problems of pacing, viewability prediction, and most particularly, error minimization.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2018108049A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES PHYSICS SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR |
| title | AD SERVING WITH MULTIPLE GOALS USING CONSTRAINT ERROR MINIMIZATION |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T01%3A32%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Yadav,%20Ishadulta&rft.date=2018-04-19&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2018108049A1%3C/epo_EVB%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 |