Motivating Time-Inconsistent Agents: A Computational Approach
From MaRDI portal
approximation algorithmsbehavioral economicscomputational complexityplanningschedulingtime-inconsistency
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06) Management decision making, including multiple objectives (90B50) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Motivating time-inconsistent agents: a computational approach
- Heterogeneous temporal probabilistic agents
- Alleviating time inconsistent behaviors via a competition scheme
- Self-coordination in time inconsistent stochastic decision problems: a planner-doer game framework
- Computational models of motivation for game-playing agents
- Time-inconsistent preferences and time-inconsistent policies
- The role of heterogeneous agents' past and forward time horizons in formulating computational models
- A simple, dynamic extension of temporal motivation theory
Cites work
Cited in
(6)
This page was built for publication: Motivating Time-Inconsistent Agents: A Computational Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959838)