Cargando…
Motivating Time-Inconsistent Agents: A Computational Approach
We study the complexity of motivating time-inconsistent agents to complete long term projects in a graph-based planning model proposed by Kleinberg and Oren (2014). 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 cru...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6447518/ https://www.ncbi.nlm.nih.gov/pubmed/31007568 http://dx.doi.org/10.1007/s00224-018-9883-0 |