Motivating Time-Inconsistent Agents: A Computational Approach

DOI10.1007/978-3-662-54110-4_22zbMath1415.90005OpenAlexW2225272567MaRDI QIDQ2959838

Dennis Kraft, Susanne Albers

Publication date: 10 February 2017

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://mediatum.ub.tum.de/doc/1540878/document.pdf

zbMATH Keywords

computational complexityschedulingbehavioral economicsplanningapproximation algorithmstime-inconsistency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Planning on an empty stomach: on agents with projection bias ⋮ Combinatorial auctions with endowment effect

Cites Work

• Unnamed Item
• Golden Eggs and Hyperbolic Discounting

This page was built for publication: Motivating Time-Inconsistent Agents: A Computational Approach