We consider an single object auction environment with interdependent valuations and a generalized Vickrey–Clark–Groves allocation mechanism that allocates the object almost efficiently in a strict ex post equilibrium. If there is a significant amount of interdependence, there are multiple rationalizable outcomes of this direct mechanism and any other mechanism that allocates the object almost efficiently. This is true whether the agents know about each others’ payoff types or not.
We consider an ascending price dynamic version of the generalized VCG mechanism. When there is complete information among the agents of their payoff types, we show that the almost efficient allocation is the unique backward induction (i.e., extensive form rationalizable) outcome of the auction, even when there are multiple rationalizable outcomes in the static version. This example illustrates the role that open auctions may play in obtaining efficient allocations by reducing strategic uncertainty.
We consider an single object auction environment with interdependent valuations and a generalized Vickrey–Clark–Groves allocation mechanism that allocates the object almost efficiently in a strict ex post equilibrium. If there is a significant amount of interdependence, there are multiple rationalizable outcomes of this direct mechanism and any other mechanism that allocates the object almost efficiently. This is true whether the agents know about each others’ payoff types or not.
We consider an ascending price dynamic version of the generalized VCG mechanism. When there is complete information among the agents of their payoff types, we show that the almost efficient allocation is the unique backward induction (i.e., extensive form rationalizable) outcome of the auction, even when there are multiple rationalizable outcomes in the static version. This example illustrates the role that open auctions may play in obtaining efficient allocations by reducing strategic uncertainty.
We consider the truthful implementation of the socially efficient allocation in a dynamic private value environment in which agents receive private information over time. We show that a suitable generalization of the Vickrey-Clark-Groves mechanism, based on the marginal contribution of each agent, leads to truthtelling in every period.
A leading example of a dynamic allocation model is the sequential auction of a single good in which the current winner of the object receives additional information about her valuation. We show that a modified sequential second price auction in which only the current winner makes a positive payment leads to truthtelling. In general allocation problems, the marginal contribution mechanism continues to induce truthtelling in every period but may now include positive transfers for many agents.
We study the efficient allocation of buyers in the presence of recommender systems. A recommender system affects the market in two ways: (i) it creates value by reducing product uncertainty for the customers and hence (ii) its recommendations can be offered as add-ons, which generates informational externalities. We investigate the impact of these factors on the efficient allocation of buyers across different products.
We find that the efficient allocation requires that the seller with the recommender system has full market share. If the recommender system is sufficiently effective in reducing uncertainty, it is optimal to have some products to be purchased by a larger group of people than others. The large group consists of customers with flexible tastes.
A social choice function is robustly implementable if there is a mechanism under which the process of iteratively eliminating strictly dominated messages leads to outcomes that agree with the social choice function for all beliefs at every type profile. In an interdependent value environment with single crossing preferences, we identify a contraction property on the preferences which together with strict ex post incentive compatibility is sufficient to guarantee robust implementation in the direct mechanism. Strict ex post incentive compatibility and the contraction property are also necessary for robust implementation in any mechanism, including indirect ones.
The contraction property requires that the interdependence is not too large. In a linear signal model, the contraction property is equivalent to an interdependence matrix having all eigenvalues smaller than one.
A social choice function is robustly implementable if there is a mechanism under which the process of iteratively eliminating strictly dominated messages leads to outcomes that agree with the social choice at every type profile. In an interdependent value environment with single crossing preferences, we identify a strict contraction property on the preferences which together with strict ex post incentive compatibility is sufficient to guarantee robust implementation in the direct mechanism. Strict EPIC and the contraction property are also necessary for robust implementation in any mechanism.
The contraction property essentially requires that the interdependence is not too large. In a linear signal model, the contraction property is equivalent to an interdependence matrix having an eigenvalue less than one.
A social choice function is robustly implementable if there is a mechanism under which the process of iteratively eliminating strictly dominated messages leads to outcomes that agree with the social choice function for all beliefs at every type profile. In an interdependent value environment with single crossing preferences, we identify a contraction property on the preferences which together with strict ex post incentive compatibility is sufficient to guarantee robust implementation in the direct mechanism. Strict ex post incentive compatibility and the contraction property are also necessary for robust implementation in any mechanism, including indirect ones.
The contraction property requires that the interdependence is not too large. In a linear signal model, the contraction property is equivalent to an interdependence matrix having all eigenvalues smaller than one.
Keywords: Mechanism design, Implementation, Robustness, Common knowledge, Interim equilibrium, Iterative deletion, Direct mechanism
We study optimal pricing in the presence of recommender systems. A recommender system affects the market in two ways: (i) it creates value by reducing product uncertainty for the customers and hence (ii) its recommendations can be offered as add-ons which generate informational externalities. The quality of the recommendation add-on is endogenously determined by sales. We investigate the impact of these factors on the optimal pricing by a seller with a recommender system against a competitive fringe without such a system.
If the recommender system is sufficiently effective in reducing uncertainty, then the seller prices otherwise symmetric products differently to have some products experienced more aggressively. Moreover, the seller segments the market so that customers with more inflexible tastes pay higher prices to get better recommendations.
A social choice function is robustly implementable if there is a mechanism under which the process of iteratively eliminating strictly dominated messages leads to outcomes that agree with the social choice at every type profile. In an interdependent value environment, we identify a strict contraction property on the preferences which together with strict ex post incentive compatibility and the strict single crossing property is sufficient to guarantee robust implementation in the direct mechanism.
The contraction property essentially requires that the interdependence is not too large. In a linear signal model, the contraction property is equivalent to an interdependence matrix having an eigenvalue less than one. The contraction property is also necessary for robust implementation in any mechanism.
We study optimal pricing in the presence of recommender systems. A recommender system affects the market in two ways: (i) it creates value by reducing product uncertainty for the customers and hence (ii) its recommendations can be offered as add-ons which generate informational externalities. The quality of the recommendation add-on is endogenously determined by sales. We investigate the impact of these factors on the optimal pricing by a seller with a recommender system against a competitive fringe without such a system.
If the recommender system is sufficiently effective in reducing uncertainty, then the seller prices otherwise symmetric products differently to have some products experienced more aggressively. Moreover, the seller segments the market so that customers with more inflexible tastes pay higher prices to get better recommendations.
Keywords: Recommender system, Collaborative filtering, Add-ons, Pricing, Information externality
A social choice function is robustly implementable if there is a mechanism under which the process of iteratively eliminating strictly dominated messages leads to outcomes that agree with the social choice at every type profile. In an interdependent value environment, we identify a strict contraction property on the preferences which together with strict ex post incentive compatibility and the strict single crossing property is sufficient to guarantee robust implementation in the direct mechanism.
The contraction property essentially requires that the interdependence is not too large. In a linear signal model, the contraction property is equivalent to an interdependence matrix having an eigenvalue less than one. The contraction property is also necessary for robust implementation in any mechanism.
Keywords: Mechanism Design, Implementation, Robustness, Common Knowledge, Interim Equilibrium, Iterative Deletion, Direct Mechanism
We survey the literature on multi-armed bandit models and their applications in economics. The multi-armed bandit problem is a statistical decision model of an agent trying to optimize his decisions while improving his information at the same time. This classic problem has received much attention in economics as it concisely models the trade-off between exploration (trying out each arm to find the best one) and exploitation (playing the arm believed to give the best payoff).