
arXiv: 2012.14736
handle: 11250/3042166
This paper explores the behavior of present-biased agents, that is, agents who erroneously anticipate the costs of future actions compared to their real costs. Specifically, the paper extends the origi- nal framework proposed by Akerlof (1991) for studying various aspects of human behavior related to time-inconsistent planning, including pro- crastination, and abandonment, as well as the elegant graph-theoretic model encapsulating this framework recently proposed by Kleinberg and Oren (2014). The benefit of this extension is twofold. First, it enables to perform fine grained analysis of the behavior of present-biased agents depending on the optimisation task they have to perform. In particular, we study covering tasks vs. hitting tasks, and show that the ratio be- tween the cost of the solutions computed by present-biased agents and the cost of the optimal solutions may differ significantly depending on the problem constraints. Second, our extension enables to study not only un- derestimation of future costs, coupled with minimization problems, but also all combinations of minimization/maximization, and underestima- tion/overestimation. We study the four scenarios, and we establish upper bounds on the cost ratio for three of them (the cost ratio for the origi- nal scenario was known to be unbounded), providing a complete global picture of the behavior of present-biased agents, as far as optimisation tasks are concerned.
FOS: Computer and information sciences, 330, Computer Science - Artificial Intelligence, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Decision theory, 004, present-biased agent, hitting set, Artificial Intelligence (cs.AI), Optimization and Control (math.OC), [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], FOS: Mathematics, combinatorial optimization, Computer Science - Multiagent Systems, time-inconsistent planning, Mathematics - Optimization and Control, Multiagent Systems (cs.MA)
FOS: Computer and information sciences, 330, Computer Science - Artificial Intelligence, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Decision theory, 004, present-biased agent, hitting set, Artificial Intelligence (cs.AI), Optimization and Control (math.OC), [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], FOS: Mathematics, combinatorial optimization, Computer Science - Multiagent Systems, time-inconsistent planning, Mathematics - Optimization and Control, Multiagent Systems (cs.MA)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
