In this paper we concentrate on ad exchange mechanisms that take into consideration the publishers’ preferences concerning the attributes of ads published in their ad space, in addition to their desire to earn money from the ads. We suggest allocation (ad placement) and pricing protocols which take into account preferences of both the publishers and the advertisers. The most promising protocol, the Weighted Bipartite Hungarian VCG protocol, collects the preferences of the auction’s participants and uses the Hungarian algorithm to maximize a weighted function of their preferences. Simulations show that this advantageous protocol can maintain a balanced budget over time while preserving most of the desired economic properties (e.g., individual rational, and truth telling), and reaches near optimal solutions.
AbramsZ. and SchwarzM., Ad auction design and user experience, Applied Economics Research Bulletin, Special Issue 1 (Auctions) (March 2008), 98–105.
2.
adBrite http://www.adbrite.com/.
3.
AggarwalG.GoelA. and MotwaniR., Truthful auctions for pricing search keywords, in: ACM-EC 2006, Ann Arbor, MI, USA (11–15 June 2006), 1–7.
4.
AggarwalG.MuthukrishnanS.Pa’lD. and Pa’lM., General auction mechanism for search advertising, in: WWW-2009, Madrid, Spain (20–24 Apr 2009), 241–250.
5.
AshkanA. and ClarkeC.L.A., Impact of query intent and search context on click through behavior in sponsored search, Knowledge and Information Systems34(2) (2013), 425–452.
6.
AtheyS. and EllisonG., Position auctions with consumersearch, The Quarterly Journal of Economics126(3) (2011), 1213–1270.
7.
AzoulayR. and DavidE., Truthful and efficient mechanisms for Website dependent advertising auctions, Multiagent and Grid Systems10(2) (2014), 67–94.
8.
BabioffM. and WalshW.E., Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation, Decision Support Systems39(1) (2005), 123–149.
9.
CavalloR., Optimal decision-making with minimal waste: Strategy proof redistribution of VCG payments, AAMAS-06, Hakodate, Japan (8–12 May 2006), 882–889.
10.
CramtonP., Ascending auctions, European Economic Review42(3–5) (1998), 745–756.
11.
CramtonP.ShohamY. and SteinbergR. (eds), Combinatorial Auctions, MIT Press, 2005.
12.
DavidE. and AzoulayR., No more damaging ads on your own webpage – strategy proof mechanisms for ad placement, IAT-2012, Macau, China (4–7 December 2012), 140–145.
13.
DüttingP.RoughgardenT. and Talgam-CohenI., Modularity and greed in double auctions, in: Proceedings of the 15th ACM Conference on Economics and Computation, Palo Alto, California, USA (2014), 241–258.
14.
DüttingP.HenzingerM. and WeberI., An expressive mechanism for auctions on the web, in: Proceedings of the 20th International Conference on World Wide Web, Hyderabad, India (28 March–1 April 2011), 127–136.
15.
EdelmanB.OstrovskyM. and SchwarzM., Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords, The American Economic Review97(1) (2007), 242–259.
16.
EdelmanB. and SchwarzM., Optimal auction design and equilibrium selection in sponsored search auctions, The American Economic Review100(2) (2010), 597–602.
17.
FaltingsB., A budget-balanced, incentive-compatible scheme for social choice, in agent-mediated electronic commerce VI, theories for and engineering of distributed mechanisms and systems, Lecture Notes in Computer Science3435 (2005), 30–43.
18.
GaleD. and ShapleyL.S., College admissions and the stability of marriage, The American Mathematical Monthly69(1) (1962), 9–15.
19.
Google Doubleclick www.google.com/adexchange/AdExchangeOverview.pdf, product information at http://www.doubleclick.com/products/advertisingexchange/index.aspx. In http://www.doubleclick.com.
20.
Google DobuleClick, Regulate your content through Ad Exchange rules, DoubleClick Ad Exchange Seller Help, in https://support.google.com/adxseller/answer/4584892?hl=en, visited 1.1.17.
21.
GrovesT., Incentives in Teams, Econometrica41(4) (1973), 617–631.
22.
GuoM. and ConitzerV., Worst-case optimal redistribution of VCG payments, in: Proceedings of the 8th ACM Conference on Electronic Commerce, San Diego, California (11–15 June 2007), 30–39.
23.
KuhnH.W., The Hungarian method for the assignment problem, Naval Research Logistics Quarterly2(1–2) (1955), 83–97.
LikhodedovA. and SandholmT., Methods for boosting revenue in combinatorial auctions, Proceedings of the National Conference on Artificial Intelligence (AAAI), San Jose, California (25–29 July 2004), 232–237.
26.
MilgromP., Putting auction theory to work: The simultaneous ascending auction, Journal of Political Economy108(2) (2000), 245–272.
27.
MunkresJ., Algorithms for the assignment and transportation problems, Journal of the Society for Industrial and Applied Mathematics5(1) (1957), 32–38.
28.
MuthukrishnanS., Ad exchange: Research issues, Internet and Network Economics Lecture Notes in the Computer Science5929 (2009), 1–12.
29.
MyersonR.B. and SatterthwaiteM.A., Efficient mechanisms for bilateral trading, Journal of Economic Theory29(2) (1983), 265–281.
30.
NaroditskiyV.GuoM.DuftonL.PolukarovM. and JenningsN.R., Redistribution of VCG payments in public project problems, in: Internet and Network Economics, Lecture Notes in Computer Science7695 (2012), 323–336.
31.
NisanN., Introduction to mechanism design (for computer scientists), in: Algorithmic Game Theory, chapter 9NisanN.RoughgardenT.TardosE. and VaziraniV. editors, Cambridge University Press, 2007.
RobertsK., The characterization of implementable social choice rules, in: Aggregation and Revelation of PreferencesLaffontJ.J., eds, North-Holland Publishing Company, 1979, pp. 321–348.
35.
ShohamY. and Leyton-BrownK., Multiagent Systems, Published by Cambridge University Press, 2010.
36.
XuH.GaoB.YangD. and LiuT.Y., Predicting advertiser bidding behaviors in sponsored search by rationality modeling, Proceedings of the 22nd International Conference on World Wide Web, Rio de Janeiro, Brazil (13–17 May 2013), 1433–1444.
37.
YangW.FengY. and XiaoB., Two pricing mechanisms in sponsored search advertising, Games4 (2013), 125–143.
