Show simple item record

dc.contributor.authorAlbers, Susanne
dc.contributor.authorKraft, Dennis
dc.date.accessioned2020-03-18 13:36:15
dc.date.accessioned2020-04-01T13:03:04Z
dc.date.accessioned2018-03-03 23:55
dc.date.accessioned2020-03-18 13:36:15
dc.date.accessioned2020-04-01T13:03:04Z
dc.date.accessioned2018-02-01 23:55:55
dc.date.accessioned2020-03-18 13:36:15
dc.date.accessioned2020-04-01T13:03:04Z
dc.date.available2020-04-01T13:03:04Z
dc.date.issued2017
dc.identifier644832
dc.identifierOCN: 1076689890en_US
dc.identifier.urihttp://library.oapen.org/handle/20.500.12657/30615
dc.description.abstractThe tendency to overestimate immediate utility is a common cognitive bias. As a result people behave inconsistently over time and fail to reach long-term goals. Behavioral economics tries to help affected individuals by implementing external incentives. However, designing robust incentives is often difficult due to imperfect knowledge of the parameter β ∈ (0, 1] quantifying a person’s present bias. Using the graphical model of Kleinberg and Oren [8], we approach this problem from an algorithmic perspective. Based on the assumption that the only information about β is its membership in some set B ⊂ (0, 1], we distinguish between two models of uncertainty: one in which β is fixed and one in which it varies over time. As our main result we show that the conceptual loss of effi- ciency incurred by incentives in the form of penalty fees is at most 2 in the former and 1 + max B/ min B in the latter model. We also give asymptotically matching lower bounds and approximation algorithms.
dc.languageEnglish
dc.subject.classificationthema EDItEUR::U Computing and Information Technologyen_US
dc.subject.otherbehavioral economics
dc.subject.otherincentive design
dc.subject.otherheterogeneous agents
dc.subject.otherapproximation algorithms
dc.subject.othervariable present bias
dc.subject.otherpenalty fees
dc.subject.otherbehavioral economics
dc.subject.otherincentive design
dc.subject.otherheterogeneous agents
dc.subject.otherapproximation algorithms
dc.subject.othervariable present bias
dc.subject.otherpenalty fees
dc.subject.otherAlice and Bob
dc.subject.otherDecision problem
dc.subject.otherGraph theory
dc.subject.otherGraphical model
dc.subject.otherNP (complexity)
dc.subject.otherTime complexity
dc.subject.otherUpper and lower bounds
dc.titleChapter The Price of Uncertainty in Present-Biased Planning
dc.typechapter
oapen.identifier.doi10.1007/978-3-319-71924-5_23
oapen.relation.isPublishedBy6c6992af-b843-4f46-859c-f6e9998e40d5
oapen.relation.isPartOfBook22a6fc0d-505e-4eb6-a842-029d12d9280d
oapen.relation.isFundedBy178e65b9-dd53-4922-b85c-0aaa74fce079
oapen.collectionEuropean Research Council (ERC)
oapen.pages15
oapen.chapternumber1
oapen.grant.number691672
oapen.grant.acronymAPEG
oapen.grant.programH2020
oapen.remark.publicRelevant Wikipedia pages: Algorithm - https://en.wikipedia.org/wiki/Algorithm; Alice and Bob - https://en.wikipedia.org/wiki/Alice_and_Bob; Approximation algorithm - https://en.wikipedia.org/wiki/Approximation_algorithm; Behavioral economics - https://en.wikipedia.org/wiki/Behavioral_economics; Decision problem - https://en.wikipedia.org/wiki/Decision_problem; Graph theory - https://en.wikipedia.org/wiki/Graph_theory; Graphical model - https://en.wikipedia.org/wiki/Graphical_model; NP (complexity) - https://en.wikipedia.org/wiki/NP_(complexity); Time complexity - https://en.wikipedia.org/wiki/Time_complexity; Upper and lower bounds - https://en.wikipedia.org/wiki/Upper_and_lower_bounds
oapen.identifier.ocn1076689890


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record