Perfect Bayesian Equilibria in Repeated Sales

A special case of Myerson's classic result describes the revenue-optimal equilibrium when a seller offers a single item to a buyer. We study a natural repeated sales extension of this model: a seller offers to sell a single fresh copy of an item to the same buyer every day via a posted price. The buyer's value for the item is unknown to the seller but is drawn initially from a publicly known distribution F and remains the same throughout. One key aspect of this game is revelation of the buyer's type through his actions: while the seller might try to learn this value to extract more revenue, the buyer is motivated to hide it to induce lower prices. If the seller is able to commit to future prices, then it is known that the best he can do is extract the Myerson optimal revenue each day. In a more realistic scenario, the seller is unable to commit and must play a perfect Bayesian equilibrium. It is known that not committing to future prices does not help the seller. Thus extracting Myerson optimal revenue each day is a natural upper bound and revenue benchmark in a setting without commitment. We study this setting without commitment and find several surprises. First, if the horizon is fixed, previous work showed that an equilibrium always exists, and all equilibria yield a very low revenue, often times only a constant amount of revenue. This is unintuitive and a far cry from the linearly growing benchmark of obtaining Myerson optimal revenue each day. Our first result shows that this is because the buyer strategies in these equilibria are necessarily unnatural. We restrict to a natural class of buyer strategies, which we call threshold strategies, and show that pure strategy threshold equilibria rarely exist. This offers an explanation for the non-prevalence of bizarre outcomes predicted by previous results. Second, if the seller can commit not to raise prices upon purchase, while still retaining the possibility of lowering prices in future, we recover the natural threshold equilibria by showing that they exist for a large class of distributions including the power law family of distributions. As an example, if the distribution F is uniform in [0, 1], the seller can extract revenue of order [EQUATION]n in n rounds as opposed to the constant revenue obtainable when he is unable to make any commitments. Finally, we consider the infinite horizon game with partial commitment, where both the seller and the buyer discount the future utility by a factor of 1 -- δ ∈ [0, 1). When the value distribution is uniform in [0, 1], there exists a threshold equilibrium with expected revenue at least 4/3+2[EQUATION]2 ~ 69% of the Myerson optimal revenue benchmark. Under some mild assumptions, this equilibrium is also unique.

[1]  J. Nash THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[2]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[3]  D. Blackwell An analog of the minimax theorem for vector payoffs. , 1956 .

[4]  J. Friedman A Non-cooperative Equilibrium for Supergames , 1971 .

[5]  R. Coase Durability and Monopoly , 1972, The Journal of Law and Economics.

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

[7]  A. Rubinstein Perfect Equilibrium in a Bargaining Model , 1982 .

[8]  Jeremy I. Bulow Durable-Goods Monopolists , 1982, Journal of Political Economy.

[9]  J. Sobel,et al.  A Multistage Model of Bargaining , 1983 .

[10]  D. Fudenberg,et al.  Sequential Bargaining with Incomplete Information , 1983 .

[11]  D. P. Baron,et al.  Regulation and information in a continuing relationship , 1984 .

[12]  J. Tirole,et al.  Planning Under Incomplete Information and the Ratchet Effect. , 1985 .

[13]  Robert B. Wilson,et al.  Foundations of Dynamic Monopoly and the Coase Conjecture , 1986 .

[14]  J. Tirole,et al.  Contract Renegotiation and Coasian Dynamics , 1988 .

[15]  J. Laffont,et al.  THE DYNAMICS OF INCENTIVE CONTRACTS , 1988 .

[16]  Klaus M. Schmidt Commitment Through Incomplete Information in a Simple Repeated Bargaining Game , 1993 .

[17]  Lawrence M. Ausubel,et al.  REPUTATION IN BARGAINING AND DURABLE GOODS MONOPOLY , 1989 .

[18]  Robert J. Aumann,et al.  Repeated Games with Incomplete Information , 1995 .

[19]  Dean P. Foster,et al.  Calibrated Learning and Correlated Equilibrium , 1997 .

[20]  Vasiliki Skreta Sequentially Optimal Mechanisms , 2000 .

[21]  Lawrence M. Ausubel,et al.  Bargaining in Incomplete Information , 2002 .

[22]  D. Fudenberg,et al.  Chapter 7 Behavior-Based Price Discrimination and Customer Recognition , 2006 .

[23]  D. Fudenberg,et al.  Behavior-Based Price Discrimination and Customer Recognition , 2007 .

[24]  Michael Ostrovsky,et al.  Reserve Prices in Internet Advertising Auctions: A Field Experiment , 2009, Journal of Political Economy.

[25]  Vincent Conitzer,et al.  Hide and Seek: Costly Consumer Privacy in a Market with Repeat Purchases , 2011, Mark. Sci..

[26]  Umar Syed,et al.  Learning Prices for Repeated Auctions with Strategic Buyers , 2013, NIPS.

[27]  S. Kakade,et al.  Optimal Dynamic Mechanism Design and the Virtual Pivot Mechanism , 2013 .

[28]  Vasiliki Skreta,et al.  Optimal Auction Design Under Non-Commitment , 2013, J. Econ. Theory.

[29]  On the Complexity of Dynamic Mechanism Design , 2014, SODA.

[30]  Nikhil R. Devanur,et al.  Simple Pricing Schemes For Consumers With Evolving Values , 2016, SODA.