Show simple item record

dc.contributor.authorWalsh, William E.
dc.contributor.authorBoutilier, Craig
dc.contributor.authorSandholm, Tuomas
dc.contributor.authorShields, Rob
dc.contributor.authorNemhauser, George
dc.contributor.authorParkes, David C.
dc.date.accessioned2010-04-27T14:50:00Z
dc.date.issued2009
dc.identifier.citationWalsh, William E., Craig Boutilier, Tuomas Sandholm, Rob Shields, George Nemhauser, and David C. Parkes. 2009. Automated channel abstraction for advertising auctions. In the Fifth Workshop on Ad Auctions, 2009. Proceedings of the Tenth ACM Conference on Electronic Commerce : July 6-10, 2009, Stanford, California.en_US
dc.identifier.urihttp://nrs.harvard.edu/urn-3:HUL.InstRepos:3996849
dc.description.abstractThe use of auction mechanisms like the GSP in online advertising can lead to loss of both efficiency and revenue when advertisers have rich preferences: even simple forms of expressiveness like budget constraints can lead to suboptimal outcomes. This has led to the recognition of the value of (sequential and/or stochastic) optimization in ad allocation. Unfortunately, natural formulations of such optimization problems fall prey to channel explosion. Specifically, available ad inventory must be partitioned into subsets, or channels, of indistinguishable supply, each channel containing inventory that is interchangeable from the perspective of each active advertiser. The number of such channels grows exponentially in the number of features of interest. We propose a means for automatically abstracting these channels, grouping together channels so that irrelevant distinctions are ignored. Our approach, based on LP/MIP column and constraint generation, dramatically reduces the number of distinct channels over which ads are allocated, thus rendering optimization computationally feasible at practical scales. Our algorithms also allow revenue/efficiency to be sacrificed in a principled fashion by ignoring potentially relevant distinctions, but retaining the most important distinctions, ignoring only those that have low impact on solution quality. This allows tradeoffs to be made between tractability and solution quality. Numerical experiments demonstrate the computational practicality of our approach as well as the quality of the abstractions generated.en_US
dc.description.sponsorshipEngineering and Applied Sciencesen_US
dc.language.isoen_USen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.hasversionhttp://www.eecs.harvard.edu/econcs/pubs/walsh09.pdfen_US
dash.licenseOAP
dc.titleAutomated Channel Abstraction for Advertising Auctionsen_US
dc.typeConference Paperen_US
dc.description.versionAuthor's Originalen_US
dash.depositing.authorParkes, David C.
dc.date.available2010-04-27T14:50:00Z
dash.contributor.affiliatedParkes, David


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record