Motivating Time-Inconsistent Agents: A Computational Approach

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10123)

Abstract

We study the complexity of motivating time-inconsistent agents to complete long term projects in a graph-based planning model as proposed by Kleinberg and Oren [5]. Given a task graph G with n nodes, our objective is to guide an agent towards a target node t under certain budget constraints. The crux is that the agent may change its strategy over time due to its present-bias. We consider two strategies to guide the agent. First, a single reward is placed at t and arbitrary edges can be removed from G. Secondly, rewards can be placed at arbitrary nodes of G but no edges must be deleted. In both cases we show that it is NP-complete to decide if a given budget is sufficient to guide the agent. For the first setting, we give complementing upper and lower bounds on the approximability of the minimum required budget. In particular, we devise a \((1+\sqrt{n})\)-approximation algorithm and prove NP-hardness for ratios greater than \(\sqrt{n}/3\). Finally, we argue that the second setting does not permit any efficient approximation unless \(\mathrm{P}=\mathrm{NP}\).

Keywords

Approximation algorithms Behavioral economics Computational complexity Planning and scheduling Time-inconsistency 

References

  1. 1.
    Akerlof, G.A.: Procrastination and obedience. Am. Econ. Rev. 81, 1–19 (1991)Google Scholar
  2. 2.
    Bryan, G., Karlan, D., Nelson, S.: Commitment devices. Ann. Rev. Econ. 2, 671–698 (2010)CrossRefGoogle Scholar
  3. 3.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)MATHGoogle Scholar
  4. 4.
    Gravin, N., Immorlica, N., Lucier, B., Pountourakis, E.: Procrastination with variable present bias. In: 17th ACM Conference on Economics and Computation, pp. 361–361. ACM, New York (2016)Google Scholar
  5. 5.
    Kleinberg, J., Oren, S.: Time-inconsistent planning: a computational problem in behavioral economics. In: 15th ACM Conference on Economics and Computation, pp. 547–564. ACM, New York (2014)Google Scholar
  6. 6.
    Kleinberg, J., Sigal, O., Manish, R.: Planning problems for sophisticated agents with present bias. In: 17th ACM Conference on Economics and Computation, pp. 343–360. ACM, New York (2016)Google Scholar
  7. 7.
    Laibson, D.: Golden eggs and hyperbolic discounting. Q. J. Econ. 112, 443–477 (1997)CrossRefMATHGoogle Scholar
  8. 8.
    Lynch, J.F.: The equivalence of theorem proving and the interconnection problem. SIGDA Newsl. 5, 31–36 (1975)CrossRefGoogle Scholar
  9. 9.
    O’Donoghue, T., Rabin, M.: Doing it now or later. Am. Econ. Rev. 89, 103–124 (1999)CrossRefGoogle Scholar
  10. 10.
    O’Donoghue, T., Rabin, M.: Incentives and self control. In: Advances in Economics and Econometrics: Theory and Application 9th World Congress, vol. 2, pp. 215–245. Cambridge University Press, Cambridge (2006)Google Scholar
  11. 11.
    O’Donoghue, T., Rabin, M.: Procrastination on long-term projects. J. Econ. Behav. Organ. 66, 161–175 (2008)CrossRefGoogle Scholar
  12. 12.
    Tang, P., Teng, Y., Wang, Z., Xiao, S., Xu, Y.: Computational issues in time-inconsistent planning (2015)Google Scholar

Copyright information

© Springer-Verlag GmbH Germany 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceTechnical University of MunichMunichGermany

Personalised recommendations