scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Generalized Envelope Theorems: Applications to Dynamic Programming

TL;DR: It is shown that the class of Lipschitz functions provides a suitable framework for the generalization of classical envelope theorems for a broad class of constrained programs relevant to economic models, in which nonconvexities play a key role, and where the primitives may not be continuously differentiable.
Abstract: We show in this paper that the class of Lipschitz functions provides a suitable framework for the generalization of classical envelope theorems for a broad class of constrained programs relevant to economic models, in which nonconvexities play a key role, and where the primitives may not be continuously differentiable. We give sufficient conditions for the value function of a Lipschitz program to inherit the Lipschitz property and obtain bounds for its upper and lower directional Dini derivatives. With strengthened assumptions we derive sufficient conditions for the directional differentiability, Clarke regularity, and differentiability of the value function, thus obtaining a collection of generalized envelope theorems encompassing many existing results in the literature. Some of our findings are then applied to decision models with discrete choices, to dynamic programming with and without concavity, to the problem of existence and characterization of Markov equilibrium in dynamic economies with nonconvexities, and to show the existence of monotone controls in constrained lattice programming problems.
Citations
More filters
Book
21 Feb 1970

986 citations

Proceedings ArticleDOI
06 Jul 2020
TL;DR: A Pricing-based Incentive Mechanism for Edge-Cloud collaboration (PIM-EC) in mobile crowd sensing, which includes the bargaining game between users and edge- cloud servers, as well as a data trading game among different edge-cloud servers deployed in different regions.
Abstract: In this paper, we propose a Pricing-based Incentive Mechanism for Edge-Cloud collaboration (PIM-EC) in mobile crowd sensing. In PIM-EC, data can be exchanged among different regions with the support of edge-cloud servers, which improves the data efficiency. For the utility conflicts between mobile sensing users and cloud servers in the traditional one-stage game, we design a two-stage game which includes the bargaining game between users and edge-cloud servers, as well as a data trading game among different edge-cloud servers deployed in different regions. For the first stage game, based on Stackelberg game model and Rubinstein bargaining model, we design a finite-period dynamic bargaining algorithm. For the second stage game, based on the optimal auction mechanism and using the augmented Lagrange multiplier method, a quasi-Newton iterative pricing algorithm is proposed. We investigate the performance of PIM-EC through simulations. Compared with SWMA and IMC-SS, the social welfare of PIM-EC is increased by 21% and 34% respectively.

11 citations


Cites methods from "Generalized Envelope Theorems: Appl..."

  • ...According to the envelope theorem [16], the derivative function of φi can be obtained as follows,...

    [...]

Journal ArticleDOI
01 Aug 2021
TL;DR: A pricing‐based incentive mechanism for edge‐cloud collaboration (PIM‐EC) in mobile crowd sensing, where data can be exchanged among different regions with the support of edge‐ cloud servers, which improves the data efficiency.
Abstract: In this article, we propose a pricing‐based incentive mechanism for edge‐cloud collaboration (PIM‐EC) in mobile crowd sensing. In PIM‐EC, data can be exchanged among different regions with...

3 citations

Journal ArticleDOI
TL;DR: In this article, the authors extend the standard Bellman's theory of dynamic programming and the theory of recursive contracts with forward-looking constraints of Marcet and Marimon (2019) to encompass non-differentiability of the value function associated with non-unique solutions or multipliers.

3 citations

Journal ArticleDOI
TL;DR: In this paper , the value function of static optimization in an abstract infinite dimensional setting has been established and applied to problems of Calculus of Variations, where Gâteaux and Hadamard differentials have been used.
References
More filters
Book
01 Jan 1983
TL;DR: The Calculus of Variations as discussed by the authors is a generalization of the calculus of variations, which is used in many aspects of analysis, such as generalized gradient descent and optimal control.
Abstract: 1. Introduction and Preview 2. Generalized Gradients 3. Differential Inclusions 4. The Calculus of Variations 5. Optimal Control 6. Mathematical Programming 7. Topics in Analysis.

9,498 citations

Book
11 May 2000
TL;DR: It is shown here how the model derived recently in [Bouchut-Boyaval, M3AS (23) 2013] can be modified for flows on rugous topographies varying around an inclined plane.
Abstract: Basic notation.- Introduction.- Background material.- Optimality conditions.- Basic perturbation theory.- Second order analysis of the optimal value and optimal solutions.- Optimal Control.- References.

2,067 citations

Book
13 Apr 1998
TL;DR: In this article, the authors introduce the concept of lattices, supermodular functions, and optimal decision models for cooperative games and non-cooperative games, and present a review of the literature.
Abstract: PrefaceCh. 1Introduction3Ch. 2Lattices, Supermodular Functions, and Related Topics7Ch. 3Optimal Decision Models94Ch. 4Noncooperative Games175Ch. 5Cooperative Games207Bibliography263Index269

1,981 citations

Journal ArticleDOI
TL;DR: 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 as mentioned in this paper.
Abstract: 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.

1,183 citations

Book
21 Feb 1970

986 citations