paper-with-me

홈 › Papers

The converse envelope theorem

2019-09-24 · Ludvig Sinander

I prove an envelope theorem with a converse: the envelope formula is equivalent to a first-order condition. Like Milgrom and Segal's (2002) envelope theorem, my result requires no structure on the choice set. I use the converse envelope theorem to extend to general outcomes and preferences the canonical result in mechanism design that any increasing allocation is implementable, and apply this to selling information.

📄 PDF Abstract BibTeX arXiv:1909.11219

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation

2026-06-06 · Yunbei Xu arxiv

We prove a variance-aware pointwise majorizing-measure theorem for centered Gaussian processes. Classical generic chaining characterizes the scalar quantity $\mathbb E\sup_{x\in T}X_x$; the theorem here gives a simultane…

Gaussian Processes

Envelope theorem and discontinuous optimisation: the case of positioning choice problems

2021-12-13 · Jean-Gabriel Lauzier

This article examines differentiability properties of the value function of positioning choice problems, a class of optimisation problems in finite-dimensional Euclidean spaces. We show that positioning choice problems' …

A Converse to Banach's Fixed Point Theorem and its CLS Completeness

2017-02-23 · Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis

Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally c…

Smooth Converse Lyapunov-Barrier Theorems for Asymptotic Stability with Safety Constraints and Reach-Avoid-Stay Specifications

2020-09-09 · Yiming Meng, Yinan Li, Maxwell Fitzsimmons, Jun Liu

Stability and safety are two important aspects in safety-critical control of dynamical systems. It has been a well established fact in control theory that stability properties can be characterized by Lyapunov functions. …

From Sublinear to Linear: Local Convergence in Finite-Width Networks via Locally Polyak-Lojasiewicz Regions

2025-07-29 · Agnideep Aich, Ashit Baran Aich, Bruce Wade arxiv

We study local linear convergence of gradient descent for finite-width feedforward networks under the squared empirical loss. Prior work shows that GD can remain confined to a Locally Quasi-Convex Region (LQCR) around in…