Online Supplement to “Keyword Auctions, Unit-Price Contracts, and the Role of Commitment”

نویسندگان

  • Jianqing Chen
  • Juan Feng
  • Andrew B. Whinston
چکیده

Proof of Lemma 1. Consider a low-performance bidder with unit valuation v who bids b and a high-performance bidder with unit valuation wv who bids wb. Both bidders get a score wb, and their payoff functions are U (y L , v, b) = y L (v − b)Pr(wb is the highest score) (W1) and U (y H , wv, wb) = y H (wv − wb)Pr(wb is the highest score). (W2) It is easy to establish that U (y H , wv, wb) = wy H y L U (y L , v, b). (W3) For b L (v) and b H (v) to be equilibrium bidding functions, at any v, b = b L (v) must maximize U (y L , v, b) and b = b H (v) must maximize U (y H , v, b). So (W3) suggests that if bidding b is the best choice for a low-performance bidder with unit valuation v, bidding wb must be the best choice for a high-performance bidder with unit valuation wv, which implies b H (wv) = wb L (v).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Keyword Auctions, Unit-Price Contracts, and the Role of Commitment

Motivated by the enormous growth of keyword advertising, this paper explores the design of performance-based unitprice contract auctions, in which bidders bid their unit prices and the winner is chosen based on both their bids and performance levels. The previous literature on unit-price contract auctions usually considers a static case where bidders’ performance levels are fixed. This paper st...

متن کامل

Bid optimization in online advertisement auctions

We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and propose a bidding heuristic to optimize the utility for bidders by equalizing the return-on-investment for each bidder across all keywords. We show that natural auction mechanisms combined with this heuristic can experience chaotic cycling (as is the case with many current advertiseme...

متن کامل

Keyword Auctions as Weighted Unit-Price Auctions

In recent years, unit-price auctions in which bidders bid their willingness-to-pay for per-unit realized outcome have been adopted by major keyword advertising providers such as Yahoo!, Google, and MSN, in selling keyword advertising slots on web sites. The majority of keyword auctions are pay-per-click auctions in which advertisers specify their willingness-to-pay per click, and pay by the cli...

متن کامل

Using Software Agents to Supplement Tests Conducted by Human Subjects

The objective of this paper is to test whether or not software agents can match the observed behavior of human subjects in laboratory tests of markets. For this purpose, one set of tests uses four software agents and two human subjects to represent six suppliers in three different market situations: no forward contracts, fixed price forward contracts, and renewable forward contracts. An identic...

متن کامل

Ranked Items Auctions and Online Advertisement

We study auctions for a set of ranked items where each buyer has a unit demand. This setting has promising applications in areas such as keyword auctions in the search engine advertising industry, the sale of quality ranked raw materials, etc. An auction mechanism suitable for this setting is the simultaneous pooled auction (SPA), where each bidder simultaneously submits a single bid and is all...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009