Abstract
We attempt to address the challenge of suggesting a useful bidding strategy to an agent in the an ad auction setting. We explore the possibility of using competitive safety strategies in that context; a C-competitive strategy guarantees a payoff which is no less than 1/C of the payoff obtained in a best Nash equilibrium. We adopt the model of ad auctions suggested by Varian and provide analysis of competitive safety strategies in that context. We first show that no useful safety competitive strategies exist in a setting with complete information about the agents’ valuations. Namely, in a setting with N bidders and exponential click-rate functions the ratio can be arbitrarily close to N. We also show that N is a general upper bound for any click-rates and valuations, while \(\sum_{t=1}^N \frac{1}{t}\) is a tight bound for linear click-rates. However, in our main results we show that, surprisingly, useful C-competitive strategies do exist in the incomplete information setting. More specifically, we show that under the assumption that agents’ valuations are uniformly distributed, an e-competitive strategy exists for the case of exponential click-rate functions, and a 2-competitive safety strategy exists for linear click-rate functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altman, A., Boden-Bercovici, A., Tennenholtz, M.: Learning in one-shot strategic form games. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, Springer, Heidelberg (2006)
Asdemir, K.: Bidding Patterns in Search Engine Auctions. Working Paper, University of Alberta School of Business (2005), Available at: http://www.business.ualberta.ca/kasdemir/biddingWARS.PDF
Aumann, R.J.: On the Non-Transferable Utility Value: A Comment on the Roth-Shaper Examples. Econometrica 53(3), 667–677 (1985)
Borgs, C., Chayes, J., Etesami, O., Immorlica, N., Jain, K., Mahdian, M.: Bid Optimization in Online Advertisement Auctions. manuscript (2005)
Carmel, D., Markovitch, S.: Exploration strategies for model-based learning in multiagent systems. Autonomous Agents and Multi-agent Systems 2(2), 141–172 (1999)
Krishna, V., Perry, M.: Efficient Mechanism Design. Technical report, Pennsylvania State University (1998), Available at: http://econ.la.psu.edu/~vkrishna/papers/vcg20.pdf
Powers, R., Shoham, Y.: New criteria and a new algorithm for learning in multi-agent systems. In: Proceedings of NIPS 2004 (2004)
Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory 2, 65–67 (1973)
Tennenholtz, M.: Competitive Safety Analysis: Robust Decision-Making in Multi-Agent Systems. Journal of Artificial Intelligence Research 17, 363–378 (2002)
Varian, H.R.: Position auctions. Technical Report, UC Berkeley (2006), Available at: http://www.sims.berkeley.edu/~hal/Papers/2006/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuminov, D., Tennenholtz, M. (2007). Competitive Safety Strategies in Position Auctions. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-77105-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77104-3
Online ISBN: 978-3-540-77105-0
eBook Packages: Computer ScienceComputer Science (R0)