Abstract
With more than four billion usage of cellular phones worldwide, mobile advertising has become an attractive alternative to online advertisements. In this paper, we propose a new targeted advertising policy for Wireless Service Providers (WSPs) via SMS or MMS- namely AdCell. In our model, a WSP charges the advertisers for showing their ads. Each advertiser has a valuation for specific types of customers in various times and locations and has a limit on the maximum available budget. Each query is in the form of time and location and is associated with one individual customer. In order to achieve a non-intrusive delivery, only a limited number of ads can be sent to each customer. Recently, new services have been introduced that offer location-based advertising over cellular network that fit in our model (e.g., ShopAlerts by AT&T) .
We consider both online and offline version of the AdCell problem and develop approximation algorithms with constant competitive ratio. For the online version, we assume that the appearances of the queries follow a stochastic distribution and thus consider a Bayesian setting. Furthermore, queries may come from different distributions on different times. This model generalizes several previous advertising models such as online secretary problem [10], online bipartite matching [13,7] and AdWords [18]. Since our problem generalizes the well-known secretary problem, no non-trivial approximation can be guaranteed in the online setting without stochastic assumptions. We propose an online algorithm that is simple, intuitive and easily implementable in practice. It is based on pre-computing a fractional solution for the expected scenario and relies on a novel use of dynamic programming to compute the conditional expectations. We give tight lower bounds on the approximability of some variants of the problem as well. In the offline setting, where full-information is available, we achieve near-optimal bounds, matching the integrality gap of the considered linear program. We believe that our proposed solutions can be used for other advertising settings where personalized advertisement is critical.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, M.: Overview of mobile advertising, http://www.telecomcircle.com/2009/11/overview-of-mobile-advertising
Andelman, N., Mansour, Y.: Auctions with budget constraints. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 26–38. Springer, Heidelberg (2004)
Azar, Y., Birnbaum, B., Karlin, A.R., Mathieu, C., Nguyen, C.T.: Improved approximation algorithms for budgeted allocations. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 186–197. Springer, Heidelberg (2008)
Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and gap. SIAM J. Comp, 2189 (2010)
Chuzhoy, J., Naor, J.S.: Covering problems with hard capacities. In: FOCS 2002, p. 481 (2002)
Devenur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: EC 2009, pp. 71–78 (2009)
Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1-1/e. In: FOCS 2009, pp. 117–126 (2009)
Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for vertex cover with hard capacities. In: ICALP 2003, pp. 164–175 (2003)
Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA 2008, pp. 982–991 (2008)
Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC 2004, pp. 71–80 (2004)
Hajiaghayi, M.T., Kleinberg, R.D., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: AAAI (2007)
Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: STOC (2011)
Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC 1990, pp. 352–358 (1990)
Krengel, U., Sucheston, L.: Semiamarts and finite values. Bull. Am. Math. Soc (1977)
Lahaie, S.: An analysis of alternative slot auction designs for sponsored search. In: EC 2006, pp. 218–227 (2006)
Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: An approach based on strongly factor-revealing lps. In: STOC (2011)
Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: Online actions based on offline statistics. In: SODA (2011)
Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54 (2007)
Pál, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: FOCS 2001, pp. 329–338 (2001)
Saha, B., Srinivasan, A.: A new approximation technique for resource-allocation problems. In: ICS 2010, pp. 342–357 (2010)
Srinivasan, A.: Budgeted allocations in the full-information setting. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX 2008. LNCS, vol. 5171, pp. 247–253. Springer, Heidelberg (2008)
Wang, S., Min, J., Yi, B.K.: Location based services for mobiles: Technologies and standards. In: ICC (2008)
Zahradnik, F.: Garmin to offer free, advertising-supported traffic detection and avoidance, http://gps.about.com/b/2008/09/15/garmin-to-offer-free-advertising-supported-traffic-detection-and-avoidance.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alaei, S., Hajiaghayi, M.T., Liaghat, V., Pei, D., Saha, B. (2011). AdCell: Ad Allocation in Cellular Networks. In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-23719-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23718-8
Online ISBN: 978-3-642-23719-5
eBook Packages: Computer ScienceComputer Science (R0)