Strategic bidding behaviors in nondecreasing sponsored search auctions
Summary: To realize the specific results in the sponsored search auctions, most advertisers submit particular bid prices. The bidding behaviors with specific purposes are called as the strategic bidding. However, some strategic bidding behaviors will result in negative effects, such as the elimination of the equilibrium and the payment increase for some advertisers. The bidding behaviors with negative results are termed as the vindictive bidding. We survey four strategic bidding behaviors which include a rational bidding and three vindictive bidding strategies. In this paper, we study the relationship between the effects resulted by the vindictive bidding and the valuations of the vindictive advertisers. In our experiments, the search engine provider (SEP) is benefited by all vindictive bidding behaviors, and the increment of the SEP's revenue is proportional to the degree of the vindictiveness. Bidding vindictively without sacrificing the own utility improves the advertiser's utility with high probability. Moreover, we observe that the SEP's revenue is improved by the following situations. First, the vindictive advertiser with low valuation in the keywords with high market value results in more SEP's revenue than that in the keywords with low market value. The second case is to raise the bidding competition between advertisers.
- Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions
- Multi-bidding strategy in sponsored search auctions
- Modeling bounded rationality for sponsored search auctions
- An experimental study of sponsored-search auctions
- Optimal bidding in multi-item multislot sponsored search auctions
- Maintaining equilibria during exploration in sponsored search auctions
- Algorithmic Game Theory
- Forward looking Nash equilibrium for keyword auction
- Game theoretic problems in network economics and mechanism design solutions
- Incentives in Teams
- Multi-bidding strategy in sponsored search auctions
- On robustness of forward-looking in sponsored search auction
- Optimal bandwidth scheduling of networked learning control system based on Nash theory and auction mechanism
This page was built for publication: Strategic bidding behaviors in nondecreasing sponsored search auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460277)