Drawing on a recent graphical model due to Kleinberg and Oren, we study the design of incentives for present-biased agents from an algorithmic perspective. First, we consider three commonly used incentives based on prohibition, penalties and rewards. We compare the conceptual costs of implementing these incentives and analyze the complexity of computing optimal designs. Secondly, we present two generalized versions of Kleinberg and Oren's model. The first model addresses incentives for multiple agents of a heterogeneous population while the second model considers incentives for a variable present-bias. Our goal is to quantify the conceptual cost that penalty based incentives incur due to these changes in the setting. Furthermore, we study the complexity of computing optimal designs in both models.
«
Drawing on a recent graphical model due to Kleinberg and Oren, we study the design of incentives for present-biased agents from an algorithmic perspective. First, we consider three commonly used incentives based on prohibition, penalties and rewards. We compare the conceptual costs of implementing these incentives and analyze the complexity of computing optimal designs. Secondly, we present two generalized versions of Kleinberg and Oren's model. The first model addresses incentives for multiple...
»