University of Cambridge > Talks.cam > Cambridge SIAM Chapter > Efficient advert assignment

Efficient advert assignment

Add to your list(s) Download to your calendar using vCal

  • UserFrank Kelly (Statslab) World_link
  • ClockMonday 27 April 2015, 16:30-17:10
  • HouseMR2, CMS.

If you have a question about this talk, please contact Eoin Devane.

This talk will describe some recent joint work with Peter Key (Microsoft Research) and Neil Walton (University of Amsterdam).

Ad-auctions are real-time algorithms that determine the adverts shown, for example, on a Google search. In current Ad-auctions there is an information asymmetry between the platform and advertisers: the platform typically knows more than an advertiser about the search being conducted, such as information about the searcher. Hence the platform can potentially choose prices and an allocation that depends on the platform’s additional information. In contrast, the advertiser has to rely on more coarse-grained information, perhaps just the search terms of a query together with a crude categorization of the searcher.

The talk will describe how the information asymmetry can be used to develop a simple mechanism for advert assignment and pricing that incentivizes truthful bidding and encourages convergence to a unique Nash equilibrium that is socially optimal.

This talk is part of the Cambridge SIAM Chapter series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity