Discrete-time dynamic principal–agent models: Contraction mapping theorem and computational treatment

Keyphrases

• Solution Method 100%
• Value Function 100%
• Discrete Dynamics 100%
• Contraction Mapping Theorem 100%
• Policy Function 50%
• Discrete-time 50%
• Rational Functions 50%
• Multiple Agents 50%
• Numerical Approximation 50%
• Planning Model 50%
• Nonlinear Program 50%
• Expected Utility 50%
• Principal Value 50%
• Unique Solution 50%
• Static Problem 50%
• Bilevel Optimization 50%
• Economic Literature 50%
• Social Planning 50%
• Convergence Results 50%
• Continuous Choice 50%
• Value Iteration 50%

Mathematics

• Contraction Mapping Theorem 100%
• Discrete Time 100%
• Function Value 66%
• Numerical Approximation 33%
• unique solution φ 33%
• Convergence Result 33%
• Rational Function 33%
• Iteration Function 33%
• Final Result 33%
• Principal Value 33%