Search Results for author:
Found 4 papers, 0 papers with code
Dynamic Pricing and Learning with Bayesian Persuasion
Our main result is a computationally efficient online algorithm that achieves an $O(T^{2/3}(m\log T)^{1/3})$ regret bound when the valuation function is linear in the product quality.
Online Bayesian Recommendation with No Regret
For each user with her own private preference and belief, the platform commits to a recommendation strategy to utilize his information advantage on the product state to persuade the self-interested user to follow the recommendation.
Competitive Information Design for Pandora's Box
We study a natural competitive-information-design variant for the Pandora's Box problem (Weitzman 1979), where each box is associated with a strategic information sender who can design what information about the box's prize value to be revealed to the agent when the agent inspects the box.
Computer Science and Game Theory
Global Concavity and Optimization in a Class of Dynamic Discrete Choice Models
Discrete choice models with unobserved heterogeneity are commonly used Econometric models for dynamic Economic behavior which have been adopted in practice to predict behavior of individuals and firms from schooling and job choices to strategic decisions in market competition.
