Budget-Management Strategies in Repeated Auctions

Managing Advertisers’ Budgets in Online Advertising Platforms

[1]  Aranyak Mehta,et al.  Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[2]  Aranyak Mehta,et al.  Online bipartite matching with unknown distributions , 2011, STOC '11.

[3]  Martin A. Lariviere,et al.  A Note on Probability Distributions with Increasing Generalized Failure Rates , 2006, Oper. Res..

[4]  Jon Feldman,et al.  Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.

[5]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.

[6]  Jon Feldman,et al.  Online Ad Assignment with Free Disposal , 2009, WINE.

[7]  Yeon-Koo Che,et al.  The Optimal Mechanism for Selling to a Budget-Constrained Buyer , 2000, J. Econ. Theory.

[8]  J. Laffont,et al.  Optimal auction with financially constrained buyers , 1996 .

[9]  Rakesh V. Vohra,et al.  Optimal auctions with financially constrained buyers , 2008, J. Econ. Theory.

[10]  Nicole Immorlica,et al.  Dynamics of bid optimization in online advertisement auctions , 2007, WWW '07.

[11]  Yonatan Gur,et al.  Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium , 2019, Manag. Sci..

[12]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[13]  Gagan Goel,et al.  Polyhedral Clinching Auctions and the AdWords Polytope , 2012, J. ACM.

[14]  Vincent Conitzer,et al.  Pacing Equilibrium in First-Price Auction Markets , 2018, EC.

[15]  Richard P. McLean,et al.  FULL EXTRACTION OF THE SURPLUS IN BAYESIAN AND DOMINANT STRATEGY AUCTIONS , 1988 .

[16]  Thomas P. Hayes,et al.  The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.

[17]  Gabriel Y. Weintraub,et al.  Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design , 2014, Manag. Sci..

[18]  G. Ryzin,et al.  Optimal dynamic pricing of inventories with stochastic demand over finite horizons , 1994 .

[19]  Vijay Kamble.  Revenue Management on an On-Demand Service Platform , 2018, WINE.

[20]  Gabriel Y. Weintraub,et al.  Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment , 2019, Oper. Res..

[21]  P. Milgrom,et al.  Adverse Selection and Auction Design for Internet Display Advertising , 2016 .

[22]  Gagan Goel,et al.  Clinching Auction with Online Supply , 2013, SODA.

[23]  Mohammad Mahdian,et al.  Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.

[24]  Sergei Vassilvitskii,et al.  A Field Guide to Personalized Reserve Prices , 2016, WWW.

[25]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[26]  Krishnamurthy Iyer,et al.  Tractable Equilibria in Sponsored Search with Endogenous Budgets , 2021, Oper. Res..

[27]  Aranyak Mehta,et al.  Optimizing budget constrained spend in search advertising , 2013, WSDM '13.

[28]  Nikhil R. Devanur,et al.  Budget smoothing for internet ad auctions: a game theoretic approach , 2013, EC '13.