Asymptotic Optimality of Finite Models for Witsenhausen’s Counterexample and Beyond

Hierarchical Production Planning in a Stochastic Manufacturing System with Long-Run Average Cost: Asymptotic Optimality and Error Bounds

SSRN Electronic Journal ◽

10.2139/ssrn.1125453 ◽

1998 ◽

Cited By ~ 4

Author(s):

Suresh Sethi ◽

Hanqin Zhang ◽

Qing Zhang

Keyword(s):

Production Planning ◽

Error Bounds ◽

Average Cost ◽

Manufacturing System ◽

Asymptotic Optimality ◽

Hierarchical Production Planning ◽

Long Run

Download Full-text

Constant Job-Allowance Policies for Appointment Scheduling: Asymptotic Optimality and Numerical Analysis

SSRN Electronic Journal ◽

10.2139/ssrn.3133508 ◽

2018 ◽

Author(s):

Shenghai Zhou ◽

Yichuan Ding ◽

Woonghee Tim Huh ◽

Guohua Wan

Keyword(s):

Numerical Analysis ◽

Asymptotic Optimality ◽

Appointment Scheduling

Download Full-text

Applications of Finite Models Properties in Approximation and Algorithmic Logics

Fundamenta Informaticae ◽

10.3233/fi-1991-14105 ◽

1991 ◽

Vol 14 (1) ◽

pp. 91-108

Author(s):

Jarosław Stepaniuk

Keyword(s):

Finite Models ◽

Elementary Theories

The purpose of this paper is to investigate some aspects concerning elementary theories of finite models and to give the applications in approximation logics and algorithmic theory of dictionaries.

Download Full-text

Complete subset averaging with many instruments

Econometrics Journal ◽

10.1093/ectj/utaa033 ◽

2020 ◽

Author(s):

Seojeong Lee ◽

Youngki Shin

Keyword(s):

Demand Function ◽

Simulation Experiment ◽

Mean Squared Error ◽

Asymptotic Optimality ◽

Weighted Average ◽

Subset Size ◽

Extensive Simulation ◽

Squared Error ◽

Many Instruments ◽

Class Of Estimators

Summary We propose a two-stage least squares (2SLS) estimator whose first stage is the equal-weighted average over a complete subset with k instruments among K available, which we call the complete subset averaging (CSA) 2SLS. The approximate mean squared error (MSE) is derived as a function of the subset size k by the Nagar (1959) expansion. The subset size is chosen by minimising the sample counterpart of the approximate MSE. We show that this method achieves asymptotic optimality among the class of estimators with different subset sizes. To deal with averaging over a growing set of irrelevant instruments, we generalise the approximate MSE to find that the optimal k is larger than otherwise. An extensive simulation experiment shows that the CSA-2SLS estimator outperforms the alternative estimators when instruments are correlated. As an empirical illustration, we estimate the logistic demand function in Berry et al. (1995) and find that the CSA-2SLS estimate is better supported by economic theory than are the alternative estimates.

Download Full-text

Multilevel Monte Carlo methods and lower–upper bounds in initial margin computations

Monte Carlo Methods and Applications ◽

10.1515/mcma-2020-2062 ◽

2020 ◽

Vol 26 (2) ◽

pp. 131-161

Author(s):

Florian Bourgey ◽

Stefano De Marco ◽

Emmanuel Gobet ◽

Alexandre Zhou

Keyword(s):

Monte Carlo ◽

Lower Bounds ◽

Asymptotic Optimality ◽

Upper Bounds ◽

Upper And Lower Bounds ◽

Independent Random Variables ◽

Outer Function ◽

Control Problems ◽

Multilevel Monte Carlo ◽

Primal Dual

AbstractThe multilevel Monte Carlo (MLMC) method developed by M. B. Giles [Multilevel Monte Carlo path simulation, Oper. Res. 56 2008, 3, 607–617] has a natural application to the evaluation of nested expectations {\mathbb{E}[g(\mathbb{E}[f(X,Y)|X])]}, where {f,g} are functions and {(X,Y)} a couple of independent random variables. Apart from the pricing of American-type derivatives, such computations arise in a large variety of risk valuations (VaR or CVaR of a portfolio, CVA), and in the assessment of margin costs for centrally cleared portfolios. In this work, we focus on the computation of initial margin. We analyze the properties of corresponding MLMC estimators, for which we provide results of asymptotic optimality; at the technical level, we have to deal with limited regularity of the outer function g (which might fail to be everywhere differentiable). Parallel to this, we investigate upper and lower bounds for nested expectations as above, in the spirit of primal-dual algorithms for stochastic control problems.

Download Full-text

Asymptotic optimality of the generalized cμ rule under model uncertainty

Stochastic Processes and their Applications ◽

10.1016/j.spa.2021.03.004 ◽

2021 ◽

Vol 136 ◽

pp. 206-236

Author(s):

Asaf Cohen ◽

Subhamay Saha

Keyword(s):

Model Uncertainty ◽

Asymptotic Optimality

Download Full-text

Asymptotic optimality for distributed spectrum sharing using bargaining solutions

IEEE Transactions on Wireless Communications ◽

10.1109/twc.2009.081340 ◽

2009 ◽

Vol 8 (10) ◽

pp. 5225-5237 ◽

Cited By ~ 52

Author(s):

J.E. Suris ◽

L.A. Dasilva ◽

Zhu Han ◽

A.B. Mackenzie ◽

R.S. Komali

Keyword(s):

Spectrum Sharing ◽

Asymptotic Optimality ◽

Bargaining Solutions

Download Full-text

THE ANNIHILATING IDEALS OF MINIMAL MODELS

International Journal of Modern Physics A ◽

10.1142/s0217751x92003793 ◽

1992 ◽

Vol 07 (supp01a) ◽

pp. 217-238 ◽

Cited By ~ 53

Author(s):

BORIS L. FEIGIN ◽

TOMOKI NAKANISHI ◽

HIROSI OOGURI

Keyword(s):

Central Charge ◽

Field Theories ◽

Conformal Field Theories ◽

Minimal Models ◽

Finite Models ◽

Conformal Field ◽

Intimate Relation ◽

Chiral Algebras

We describe several aspects of the annihilating ideals and reduced chiral algebras of conformal field theories, especially, minimal models of Wn algebras. The structure of the annihilating ideal and a vanishing condition is given. Using the annihilating ideal, the structure of quasi-finite models of the Virasoro (2,q) minimal models are studied, and their intimate relation to the Gordon identities are discussed. We also show the examples in which the reduced algebras of Wn and Wℓ algebras at the same central charge are isomorphic to each other.

Download Full-text