License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.10
URN: urn:nbn:de:0030-drops-73876
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7387/
Go to the corresponding LIPIcs Volume Portal

Albers, Susanne ; Kraft, Dennis

On the Value of Penalties in Time-Inconsistent Planning

pdf-format:
LIPIcs-ICALP-2017-10.pdf (0.5 MB)

Abstract

People tend to behave inconsistently over time due to an inherent present bias. As this may impair performance, social and economic settings need to be adapted accordingly. Common tools to reduce the impact of time-inconsistent behavior are penalties and prohibition. Such tools are called commitment devices. In recent work Kleinberg and Oren [EC, 2014] connect the design of a prohibition-based commitment device to a combinatorial problem in which edges are removed from a task graph G with n nodes. However, this problem is NP-hard to approximate within a ratio less than n^(1/2)/3 [Albers and Kraft, WINE, 2016]. To address this issue, we propose a penalty-based commitment device that does not delete edges, but raises their cost. The benefits of our approach are twofold. On the conceptual side, we show that penalties are up to 1/beta times more efficient than prohibition, where 0 < beta <= 1 parameterizes the present bias. On the computational side, we improve approximability by presenting a 2-approximation algorithm for allocating penalties. To complement this result, we prove that optimal penalties are NP-hard to approximate within a ratio of 1.08192.

BibTeX - Entry

@InProceedings{albers_et_al:LIPIcs:2017:7387,
  author =	{Susanne Albers and Dennis Kraft},
  title =	{{On the Value of Penalties in Time-Inconsistent Planning}},
  booktitle =	{44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
  pages =	{10:1--10:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-041-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{80},
  editor =	{Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7387},
  URN =		{urn:nbn:de:0030-drops-73876},
  doi =		{10.4230/LIPIcs.ICALP.2017.10},
  annote =	{Keywords: approximation algorithms, behavioral economics, commitment devices, computational complexity, time-inconsistent preferences}
}

Keywords: approximation algorithms, behavioral economics, commitment devices, computational complexity, time-inconsistent preferences
Collection: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Issue Date: 2017
Date of publication: 07.07.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI