• Corpus ID: 1182

For-profit mediators in sponsored search advertising

  title={For-profit mediators in sponsored search advertising},
  author={Sudhir Kumar Singh and Vwani P. Roychowdhury and Himawan Gunadhi and Behnam Attaran Rezaei},
A mediator is a well-known construct in game theory, and is an entity that plays on behalf of some of the agents who choose to use its services, while the rest of the agents participate in the game directly. We initiate a game theoretic study of sponsored search auctions, such as those used by Google and Yahoo!, involving {\em incentive driven} mediators. We refer to such mediators as {\em for-profit} mediators, so as to distinguish them from mediators introduced in prior work, who have no… 


Mediators in position auctions
This paper introduces a study of mediators for games with incomplete information, and applies it to the context of position auctions, a central topic in electronic commerce.
Capacity Constraints and the Inevitability of Mediators in Adword Auctions
This analysis indicates that there are significant opportunities for diversification in the internet economy and should expect it to continue to develop richer structure, with room for different types of agents and mechanisms to coexist.
An analysis of alternative slot auction designs for sponsored search
It is found that the informational requirements of RBB are much weaker than those of RBR, but that RBR is efficient whereas RBB is not, and that no equilibrium exists with first pricing using either RBB or RBR.
Revenue analysis of a family of ranking rules for keyword auctions
It is found that in general neither Yahoo! and Google's auction designs is necessarily revenue-optimal in equilibrium, and that the choice of ranking rule can be guided by considering the correlation between bidders' values and click-through rates.
Truthful auctions for pricing search keywords
We present a truthful auction for pricing advertising slots on a web-page assuming that advertisements for different merchants must be ranked in decreasing order of their (weighted) bids. This
Allocating online advertisement space with unreliable estimates
The problem of optimally allocating online advertisement space to budget-constrained advertisers is studied and an algorithm that takes advantage of the given estimates of the frequencies of keywords to compute a near optimal solution when the estimates are accurate, while at the same time maintaining a good worst-case competitive ratio.
AdWords and generalized on-line matching
The notion of a tradeoff revealing LP is introduced and used to derive two optimal algorithms achieving competitive ratios of 1-1/e for this problem of online bipartite matching.
Mediators in P osition Auctions, EC 2007 and references therein
  • 2007
Allocating online a dvertisement space with unreliable estimates, EC
  • 2007
  • Pennock, Revenue Analysis of a Family of Rank ing Rules for Keyword Auctions, EC
  • 2007