arXiv subjects

Mohammad Reza Khani

Publications and source records attributed to Mohammad Reza Khani.

3 recordsLinked to original sources

arXiv2020

Fast Core Pricing for Rich Advertising Auctions

Standard ad auction formats do not immediately extend to settings where multiple size configurations and layouts are available to advertisers. In these settings, the sale of web advertising space increasingly resembles a combinatorial auction with complementarities, where truthful auctions such as the Vickrey-Clarke-Groves (VCG) can yield unacceptably low revenue. We therefore study core selecting auctions, which boost revenue by setting payments so that no group of agents, including the auctioneer, can jointly improve their utilities by switching to a different outcome. Our main result is a combinatorial algorithm that finds an approximate bidder optimal core point with almost linear number of calls to the welfare maximization oracle. Our algorithm is faster than previously-proposed heuristics in the literature and has theoretical guarantees. We conclude that core pricing is implementable even for very time sensitive practical use cases such as realtime auctions for online advertising and can yield more revenue. We justify this claim experimentally using the Microsoft Bing Ad Auction data, through which we show our core pricing algorithm generates almost 26% more revenue than VCG on average, about 9% more revenue than other core pricing rules known in the literature, and almost matches the revenue of the standard Generalized Second Price (GSP) auction.

cs.GT↗

arXiv2015

Core-competitive Auctions

One of the major drawbacks of the celebrated VCG auction is its low (or zero) revenue even when the agents have high value for the goods and a {\em competitive} outcome could have generated a significant revenue. A competitive outcome is one for which it is impossible for the seller and a subset of buyers to `block' the auction by defecting and negotiating an outcome with higher payoffs for themselves. This corresponds to the well-known concept of {\em core} in cooperative game theory. In particular, VCG revenue is known to be not competitive when the goods being sold have complementarities. A bottleneck here is an impossibility result showing that there is no auction that simultaneously achieves competitive prices (a core outcome) and incentive-compatibility. In this paper we try to overcome the above impossibility result by asking the following natural question: is it possible to design an incentive-compatible auction whose revenue is comparable (even if less) to a competitive outcome? Towards this, we define a notion of {\em core-competitive} auctions. We say that an incentive-compatible auction is $α$-core-competitive if its revenue is at least $1/α$ fraction of the minimum revenue of a core-outcome. We study the Text-and-Image setting. In this setting, there is an ad slot which can be filled with either a single image ad or $k$ text ads. We design an $O(\ln \ln k)$ core-competitive randomized auction and an $O(\sqrt{\ln(k)})$ competitive deterministic auction for the Text-and-Image setting. We also show that both factors are tight.

cs.GT↗

arXiv2015

Randomized Revenue Monotone Mechanisms for Online Advertising

Online advertising is the main source of revenue for many Internet firms. A central component of online advertising is the underlying mechanism that selects and prices the winning ads for a given ad slot. In this paper we study designing a mechanism for the Combinatorial Auction with Identical Items (CAII) in which we are interested in selling $k$ identical items to a group of bidders each demanding a certain number of items between $1$ and $k$. CAII generalizes important online advertising scenarios such as image-text and video-pod auctions [GK14]. In image-text auction we want to fill an advertising slot on a publisher's web page with either $k$ text-ads or a single image-ad and in video-pod auction we want to fill an advertising break of $k$ seconds with video-ads of possibly different durations. Our goal is to design truthful mechanisms that satisfy Revenue Monotonicity (RM). RM is a natural constraint which states that the revenue of a mechanism should not decrease if the number of participants increases or if a participant increases her bid. [GK14] showed that no deterministic RM mechanism can attain PoRM of less than $\ln(k)$ for CAII, i.e., no deterministic mechanism can attain more than $\frac{1}{\ln(k)}$ fraction of the maximum social welfare. [GK14] also design a mechanism with PoRM of $O(\ln^2(k))$ for CAII. In this paper, we seek to overcome the impossibility result of [GK14] for deterministic mechanisms by using the power of randomization. We show that by using randomization, one can attain a constant PoRM. In particular, we design a randomized RM mechanism with PoRM of $3$ for CAII.

cs.GT↗