.png){kind=icon}
返回
Envelope theorems for arbitrary choice sets
.png){kind=icon}
OA
AI
DOI：10.1111/1468-0262.00296.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The standard envelope theorems apply to choice sets with convex and topological structure, providing sufficient conditions for the value function to be differentiable in a parameter and characterizing its derivative. This paper studies optimization with arbitrary choice sets and shows that the traditional envelope formula holds at any differentiability point of the value function. We also provide conditions for the value function to be, variously, absolutely continuous, left- and right-differentiable, or fully differentiable. These results are applied to mechanism design, convex programming, continuous optimization problems, saddle-point problems, problems with parameterized constraints, and optimal stopping problems.
Keyword:
envelope theorem
differentiable value function
sensitivity analysis
math programming
mechanism design
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
3.0K
被引数:
4.3W
机构
暂无机构信息
引用论文
分享收藏Stopping Rules in Principal Components Analysis: A Comparison of Heuristical and Statistical Approaches.png)
Ecology
EcologyIF0
PREAI
分享收藏分享收藏The relation between parents' mental state talk and children's social understanding: A meta‐analysisOAAI
OAAI分享收藏分享收藏A Maximum Power Point Tracking Algorithm of Load Current Maximization-Perturbation and Observation Method with Variable Step SizeSymmetry
OAAI
SymmetryIF0
OAAI分享收藏The Mirrlees approach to mechanism design with renegotiation (with applications to hold-up and risk sharing)ECONOMETRICA
ECONOMETRICAIF7.1
PREAI
分享收藏
查看更多内容