M
Michael Schwarz
Researcher at Google
Publications - 86
Citations - 3681
Michael Schwarz is an academic researcher from Google. The author has contributed to research in topics: Common value auction & Matching (statistics). The author has an hindex of 23, co-authored 86 publications receiving 3526 citations. Previous affiliations of Michael Schwarz include University of California, Berkeley & Harvard University.
Papers
More filters
Journal ArticleDOI
Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords
TL;DR: In this article, the authors investigate the generalized second-price (GSP) auction, a new mechanism used by search engines to sell online advertising, and show that it has a unique equilibrium, with the same payoffs to all players as the dominant strategy equilibrium of VCG.
Posted Content
Reserve Prices in Internet Advertising Auctions: A Field Experiment
TL;DR: In this paper, the authors present the results of a large field experiment on setting reserve prices in auctions for online advertisements, guided by the theory of optimal auction design suitably adapted to the sponsored search setting.
Proceedings ArticleDOI
Reserve prices in internet advertising auctions: a field experiment
TL;DR: A large field experiment on setting reserve prices in auctions for online advertisements guided by the theory of optimal auction design suitably adapted to the sponsored search setting shows that following the introduction of new reserve prices revenues in these auctions have increased substantially.
Journal ArticleDOI
Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords
TL;DR: The generalized second price auction (GSP) as discussed by the authors is a new mechanism which is used by search engines to sell online advertising that most Internet users encounter daily, and it is tailored to its unique environment.
Proceedings ArticleDOI
Greedy bidding strategies for keyword auctions
Matthew Cary,Aparna Das,Ben Edelman,Ioannis Giotis,Kurtis Heimerl,Anna R. Karlin,Claire Mathieu,Michael Schwarz +7 more
TL;DR: In a model in which only one randomly chosen player updates each round according to the balanced bidding strategy, it is proved that convergence occurs with probability 1 and a simple variant which is guaranteed to converge to the same fixed point for any number of slots is presented.