12 research outputs found
Search advertising
Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic search engine charges advertisers too high a price, and has incentives to provide a suboptimal matching quality. Competition among search engines eliminates the latter distortion, but exacerbates the former
Integration and search engine bias
Competition authorities all over the world worry that integration between search engines (mainly Google) and publishers could lead to abuses of dominant position. In particular, one concern is that of own-content bias, meaning that Google would bias its rankings in favor of the publishers it owns or has an interest in, to the detriment of competitors and users. In order to investigate this issue, we develop a theoretical framework in which the search engine (i) allocates users across publishers, and (ii) competes with publishers to attract advertisers. We show that the search engine is biased against publishers that display many ads - even without integration. Although integration may lead to own-content bias, it can also reduce bias by increasing the value of a marginal consumer to the search engine. Integration also has a positive effect on users by reducing the nuisance costs due to excessive advertising. Its net effect is therefore ambiguous in general, and we provide sufficient conditions for it to be desirable or not
Online advertising and privacy
An online platform makes a profit by auctioning an advertising slot that appears whenever a consumer visits its website. Several firms compete in the auction, and consumers differ in their preferences. Prior to the auction, the platform gathers data which is statistically correlated with consumers' tastes for products. We study the implications of the platform's decision to allow potential advertisers to access the data about consumers' characteristics before they bid. On top of the familiar trade-off between rent extraction and efficiency, we identify a new trade-off: the disclosure of information leads to a better matching between firms and consumers, but results in a higher equilibrum price on the product market. We find that the equilbrium price is an increasing function of the number of firms. As the number of firms becomes large, it is always profitable for the platform to disclose the information, but this need not be efficient, because of the distortion caused by the higher prices. When the quality of the match represents vertical shifts in the demand function, we provide conditions under which disclosure is optimal
Online Advertising and Privacy
An online platform makes a profit by auctioning an advertising slot that appears whenever a consumer visits its website. Several firms compete in the auction, and consumers differ in their preferences. Prior to the auction, the platform gathers data which is statistically correlated with consumers' tastes for products. We study the implications of the platform's decision to allow potential advertisers to access the data about consumers' characteristics before they bid. On top of the familiar trade-off between rent extraction and efficiency, we identify a new trade-off: the disclosure of information leads to a better matching between firms and consumers, but results in a higher equilibrum price on the product market. We find that the equilbrium price is an increasing function of the number of firms. As the number of firms becomes large, it is always profitable for the platform to disclose the information, but this need not be efficient, because of the distortion caused by the higher prices. When the quality of the match represents vertical shifts in the demand function, we provide conditions under which disclosure is optimal