@techreport{oai:ipsj.ixsq.nii.ac.jp:00050116,
 author = {櫻井, 祐子 and 岩崎, 敦 and 横尾, 真 and Yuko, SAKURAI and Atushi, IWASAKI and Makoto, YOKOO},
 issue = {106(2007-ICS-149)},
 month = {Oct},
 note = {現在，Yahoo! や Google などの検索エンジンでは検索結果の周囲に関連した広告が表示される．このような広告の掲載位置を決定するためにオークションが利用されている．既存のキーワード広告オークションは掲載数は固定されているが，掲載数を入札額に応じて変動させた方が社会的に望ましいと考える．そこで，掲載数が可変のとき，既存プロトコルを適用した場合の問題点とその解決策を示す．, In a keyword auction, advertisers submit their bids to search keywords and their ads are displayed according the result of the auction when people search the keyword on internet search engines. In existing keyword auctions, the number of slots is determined in advance and the obtained social surplus is not always maximized. Thus, we develop new keyword auction protocols in which the auctioneer can flexibly determine the optimal number of slots which maximizes social surplus. First, we propose an auction protocol based on the Vickrey-Clarke-Groves mechanism. While the VCG can satisfy theoretically good characteristics, it needs the complicated calculation of payment. Therefore, we propose a practical protocol based on existing auction protocol applied in Google and Yahoo!},
 title = {適切な掲載数を決定するキーワード広告オークションの提案},
 year = {2007}
}