Optimal Bidding Strategies and Equilibria in Dynamic Auctions with Budget Constraints

30 Pages Posted: 24 May 2012 Last revised: 8 Oct 2013

See all articles by Ramki Gummadi

Ramki Gummadi

Stanford University

Peter Key

Microsoft Research Cambridge

Alexandre Proutiere

Royal Institute of Technology (KTH)

Date Written: October 7, 2013


How should agents bid in repeated sequential auctions when they are budget constrained? A motivating example is that of sponsored search auctions, where advertisers bid in a sequence of generalized second price (GSP) auctions. These auctions, specifically in the context of sponsored search, have many idiosyncratic features that distinguish them from other models of sequential auctions: First, each bidder competes in a large number of auctions, where each auction is worth very little. Second, the total bidder population is often large, which means it is unrealistic to assume that the bidders could possibly optimize their strategy by modeling specific opponents. Third, the presence of a virtually unlimited supply of these auctions means bidders are necessarily expense constrained.

Motivated by these three factors, we first frame the generic problem as a discounted Markov Decision Process for which the environment is independent and identically distributed over time. We also allow the agents to receive income to augment their budget at a constant rate. We first provide a structural characterization of the associated value function and the optimal bidding strategy, which specifies the extent to which agents underbid from their true valuation due to long term budget constraints. We then provide an explicit characterization of the optimal bid shading factor in the limiting regime where the discount rate tends to zero, by identifying the limit of the value function in terms of the solution to a differential equation that can be solved efficiently. Finally, we proved the existence of Mean Field Equilibria for both the repeated second price and GSP auctions with a large number of bidders.

Suggested Citation

Gummadi, Ramki and Key, Peter and Proutiere, Alexandre, Optimal Bidding Strategies and Equilibria in Dynamic Auctions with Budget Constraints (October 7, 2013). Available at SSRN: https://ssrn.com/abstract=2066175 or http://dx.doi.org/10.2139/ssrn.2066175

Ramki Gummadi (Contact Author)

Stanford University ( email )

Stanford, CA 94305
United States

Peter Key

Microsoft Research Cambridge ( email )

7 J J Thomson Avenue
Cambridge, CB3 0FB
United Kingdom

Alexandre Proutiere

Royal Institute of Technology (KTH) ( email )

Lindstedtsvägen 30-100 44
Stockholm, SE-100 44

Do you have negative results from your research you’d like to share?

Paper statistics

Abstract Views
PlumX Metrics