Youngki Shin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Youngki Shin has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Myung Hwan Seo
Department of Economics Seoul National University
6 shared publications - Sokbae Lee
Columbia University, 420 West 118th Street, New York, NY 10027, USA
6 shared publications - Yuan Liao
Rutgers University. New Brunswick, NJ 08901, USA
6 shared publications - Seungjin Han
Social Sciences and Humanities Research Council of Canada Department of Economics McMaster University 1280 Main Street Hamilton L8S 4M4. ON Canada
3 shared publications Alex Sam
2 shared publications- Alex Sam
Dept. of Economics McMaster University Canada
2 shared publications
Latest Publications
- Open Access
- 3 March 2026
- Published by Elsevier in SSRN Electronic Journal
Optimal Wage Band for Job Matching with Signaling
We study an optimal wage band problem in a competitive matching labor market where education signals worker ability. We prove uniqueness of the competitive signaling equilibrium under a general class of utility and profit functions and show that the optimal wage band problem is isomorphic to a simpler optimal ability threshold problem. Using a parametric model, we analyze how wage bands improve welfare relative to no intervention. Our results highlight novel mechanisms driven by asymmetric information, contrasting with existing literature. The framework is broadly applicable to settings where agents invest in costly signals under asymmetric information in competitive matching environments.
- 3 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessOptimal Wage Band for Job Matching with Signaling
We study an optimal wage band problem in a competitive matching labor market where education signals worker ability. We prove uniqueness of the competitive signaling equilibrium under a general class of utility and profit functions and show that the optimal wage band problem is isomorphic to a simpler optimal ability threshold problem. Using a parametric model, we analyze how wage bands improve welfare relative to no intervention. Our results highlight novel mechanisms driven by asymmetric information, contrasting with existing literature. The framework is broadly applicable to settings where agents invest in costly signals under asymmetric information in competitive matching environments.
- Open Access
- 6 February 2024
- Published by Elsevier in Journal of Economic Theory
- Vol. 216
Monotone equilibrium in matching markets with signaling
- 6 February 2024
- Published by Elsevier in Journal of Economic Theory
- Vol. 216
Open AccessMonotone equilibrium in matching markets with signaling
- Open Access
Monotone Equilibrium in Matching Markets with Signaling
We introduce a notion of competitive signaling equilibrium (CSE) in one-to-one matching markets with a continuum of heterogeneous senders and receivers. We then study monotone CSE where equilibrium outcomes - sender actions, receiver reactions, beliefs, and matching - are all monotone in the stronger set order. We show that if the sender utility is monotone-supermodular and the receiver's utility is weakly monotone-supermodular, a CSE is stronger monotone if and only if it passes Criterion D1 (Cho and Kreps (1987), Banks and Sobel (1987)). Given any interval of feasible reactions that receivers can take, we fully characterize a unique stronger monotone CSE and establishes its existence with quasilinear utility functions.
Open AccessMonotone Equilibrium in Matching Markets with Signaling
We introduce a notion of competitive signaling equilibrium (CSE) in one-to-one matching markets with a continuum of heterogeneous senders and receivers. We then study monotone CSE where equilibrium outcomes - sender actions, receiver reactions, beliefs, and matching - are all monotone in the stronger set order. We show that if the sender utility is monotone-supermodular and the receiver's utility is weakly monotone-supermodular, a CSE is stronger monotone if and only if it passes Criterion D1 (Cho and Kreps (1987), Banks and Sobel (1987)). Given any interval of feasible reactions that receivers can take, we fully characterize a unique stronger monotone CSE and establishes its existence with quasilinear utility functions.
- Open Access
Fast Inference for Quantile Regression with Tens of Millions of Observations
Big data analytics has opened new avenues in economic research, but the challenge of analyzing datasets with tens of millions of observations is substantial. Conventional econometric methods based on extreme estimators require large amounts of computing resources and memory, which are often not readily available. In this paper, we focus on linear quantile regression applied to "ultra-large" datasets, such as U.S. decennial censuses. A fast inference framework is presented, utilizing stochastic subgradient descent (S-subGD) updates. The inference procedure handles cross-sectional data sequentially: (i) updating the parameter estimate with each incoming "new observation", (ii) aggregating it as a $\textit{Polyak-Ruppert}$ average, and (iii) computing a pivotal statistic for inference using only a solution path. The methodology draws from time-series regression to create an asymptotically pivotal statistic through random scaling. Our proposed test statistic is calculated in a fully online fashion and critical values are calculated without resampling. We conduct extensive numerical studies to showcase the computational merits of our proposed inference. For inference problems as large as $(n, d) \sim (10^7, 10^3)$, where $n$ is the sample size and $d$ is the number of regressors, our method generates new insights, surpassing current inference methods in computation. Our method specifically reveals trends in the gender gap in the U.S. college wage premium using millions of observations, while controlling over $10^3$ covariates to mitigate confounding effects.Open AccessFast Inference for Quantile Regression with Tens of Millions of Observations
Big data analytics has opened new avenues in economic research, but the challenge of analyzing datasets with tens of millions of observations is substantial. Conventional econometric methods based on extreme estimators require large amounts of computing resources and memory, which are often not readily available. In this paper, we focus on linear quantile regression applied to "ultra-large" datasets, such as U.S. decennial censuses. A fast inference framework is presented, utilizing stochastic subgradient descent (S-subGD) updates. The inference procedure handles cross-sectional data sequentially: (i) updating the parameter estimate with each incoming "new observation", (ii) aggregating it as a $\textit{Polyak-Ruppert}$ average, and (iii) computing a pivotal statistic for inference using only a solution path. The methodology draws from time-series regression to create an asymptotically pivotal statistic through random scaling. Our proposed test statistic is calculated in a fully online fashion and critical values are calculated without resampling. We conduct extensive numerical studies to showcase the computational merits of our proposed inference. For inference problems as large as $(n, d) \sim (10^7, 10^3)$, where $n$ is the sample size and $d$ is the number of regressors, our method generates new insights, surpassing current inference methods in computation. Our method specifically reveals trends in the gender gap in the U.S. college wage premium using millions of observations, while controlling over $10^3$ covariates to mitigate confounding effects. - Open Access
SGMM: Stochastic Approximation to Generalized Method of Moments
We introduce a new class of algorithms, Stochastic Generalized Method of Moments (SGMM), for estimation and inference on (overidentified) moment restriction models. Our SGMM is a novel stochastic approximation alternative to the popular Hansen (1982) (offline) GMM, and offers fast and scalable implementation with the ability to handle streaming datasets in real time. We establish the almost sure convergence, and the (functional) central limit theorem for the inefficient online 2SLS and the efficient SGMM. Moreover, we propose online versions of the Durbin-Wu-Hausman and Sargan-Hansen tests that can be seamlessly integrated within the SGMM framework. Extensive Monte Carlo simulations show that as the sample size increases, the SGMM matches the standard (offline) GMM in terms of estimation accuracy and gains over computational efficiency, indicating its practical value for both large-scale and online datasets. We demonstrate the efficacy of our approach by a proof of concept using two well known empirical examples with large sample sizes.
Open AccessSGMM: Stochastic Approximation to Generalized Method of Moments
We introduce a new class of algorithms, Stochastic Generalized Method of Moments (SGMM), for estimation and inference on (overidentified) moment restriction models. Our SGMM is a novel stochastic approximation alternative to the popular Hansen (1982) (offline) GMM, and offers fast and scalable implementation with the ability to handle streaming datasets in real time. We establish the almost sure convergence, and the (functional) central limit theorem for the inefficient online 2SLS and the efficient SGMM. Moreover, we propose online versions of the Durbin-Wu-Hausman and Sargan-Hansen tests that can be seamlessly integrated within the SGMM framework. Extensive Monte Carlo simulations show that as the sample size increases, the SGMM matches the standard (offline) GMM in terms of estimation accuracy and gains over computational efficiency, indicating its practical value for both large-scale and online datasets. We demonstrate the efficacy of our approach by a proof of concept using two well known empirical examples with large sample sizes.
- Open Access
csa2sls: A complete subset approach for many instruments using Stata
We develop a Stata command $\texttt{csa2sls}$ that implements the complete subset averaging two-stage least squares (CSA2SLS) estimator in Lee and Shin (2021). The CSA2SLS estimator is an alternative to the two-stage least squares estimator that remedies the bias issue caused by many correlated instruments. We conduct Monte Carlo simulations and confirm that the CSA2SLS estimator reduces both the mean squared error and the estimation bias substantially when instruments are correlated. We illustrate the usage of $\texttt{csa2sls}$ in Stata by an empirical application.Open Accesscsa2sls: A complete subset approach for many instruments using Stata
We develop a Stata command $\texttt{csa2sls}$ that implements the complete subset averaging two-stage least squares (CSA2SLS) estimator in Lee and Shin (2021). The CSA2SLS estimator is an alternative to the two-stage least squares estimator that remedies the bias issue caused by many correlated instruments. We conduct Monte Carlo simulations and confirm that the CSA2SLS estimator reduces both the mean squared error and the estimation bias substantially when instruments are correlated. We illustrate the usage of $\texttt{csa2sls}$ in Stata by an empirical application. - Open Access
Optimal Delegation in Markets for Matching with Signaling
This paper studies a delegation problem faced by the planner who wants to regulate receivers' reaction choices in markets for matching between receivers and senders with signaling. We provide a noble insight into the planner's willingness to delegate and the design of optimal (reaction) interval delegation as a solution to the planner's general mechanism design problem. The relative heterogeneity of receiver types and the productivity of the sender' signal are crucial in deriving optimal interval delegation in the presence of the trade-off between matching efficiency and signaling costs.
Open AccessOptimal Delegation in Markets for Matching with Signaling
This paper studies a delegation problem faced by the planner who wants to regulate receivers' reaction choices in markets for matching between receivers and senders with signaling. We provide a noble insight into the planner's willingness to delegate and the design of optimal (reaction) interval delegation as a solution to the planner's general mechanism design problem. The relative heterogeneity of receiver types and the productivity of the sender' signal are crucial in deriving optimal interval delegation in the presence of the trade-off between matching efficiency and signaling costs.
- Open Access
Predictive Quantile Regression with Mixed Roots and Increasing Dimensions: The ALQR Approach
In this paper we propose the adaptive lasso for predictive quantile regression (ALQR). Reflecting empirical findings, we allow predictors to have various degrees of persistence and exhibit different signal strengths. The number of predictors is allowed to grow with the sample size. We study regularity conditions under which stationary, local unit root, and cointegrated predictors are present simultaneously. We next show the convergence rates, model selection consistency, and asymptotic distributions of ALQR. We apply the proposed method to the out-of-sample quantile prediction problem of stock returns and find that it outperforms the existing alternatives. We also provide numerical evidence from additional Monte Carlo experiments, supporting the theoretical results.
Open AccessPredictive Quantile Regression with Mixed Roots and Increasing Dimensions: The ALQR Approach
In this paper we propose the adaptive lasso for predictive quantile regression (ALQR). Reflecting empirical findings, we allow predictors to have various degrees of persistence and exhibit different signal strengths. The number of predictors is allowed to grow with the sample size. We study regularity conditions under which stationary, local unit root, and cointegrated predictors are present simultaneously. We next show the convergence rates, model selection consistency, and asymptotic distributions of ALQR. We apply the proposed method to the out-of-sample quantile prediction problem of stock returns and find that it outperforms the existing alternatives. We also provide numerical evidence from additional Monte Carlo experiments, supporting the theoretical results.
- Open Access
Statistical Treatment Rules under Social Interaction
In this paper we study treatment assignment rules in the presence of social interaction. We construct an analytical framework under the anonymous interaction assumption, where the decision problem becomes choosing a treatment fraction. We propose a multinomial empirical success (MES) rule that includes the empirical success rule of Manski (2004) as a special case. We investigate the non-asymptotic bounds of the expected utility based on the MES rule. Finally, we prove that the MES rule achieves the asymptotic optimality with the minimax regret criterion.
Open AccessStatistical Treatment Rules under Social Interaction
In this paper we study treatment assignment rules in the presence of social interaction. We construct an analytical framework under the anonymous interaction assumption, where the decision problem becomes choosing a treatment fraction. We propose a multinomial empirical success (MES) rule that includes the empirical success rule of Manski (2004) as a special case. We investigate the non-asymptotic bounds of the expected utility based on the MES rule. Finally, we prove that the MES rule achieves the asymptotic optimality with the minimax regret criterion.
- Open Access
Complete Subset Averaging for Quantile Regressions
We propose a novel conditional quantile prediction method based on complete subset averaging (CSA) for quantile regressions. All models under consideration are potentially misspecified and the dimension of regressors goes to infinity as the sample size increases. Since we average over the complete subsets, the number of models is much larger than the usual model averaging method which adopts sophisticated weighting schemes. We propose to use an equal weight but select the proper size of the complete subset based on the leave-one-out cross-validation method. Building upon the theory of Lu and Su (2015), we investigate the large sample properties of CSA and show the asymptotic optimality in the sense of Li (1987). We check the finite sample performance via Monte Carlo simulations and empirical applications.
Open AccessComplete Subset Averaging for Quantile Regressions
We propose a novel conditional quantile prediction method based on complete subset averaging (CSA) for quantile regressions. All models under consideration are potentially misspecified and the dimension of regressors goes to infinity as the sample size increases. Since we average over the complete subsets, the number of models is much larger than the usual model averaging method which adopts sophisticated weighting schemes. We propose to use an equal weight but select the proper size of the complete subset based on the leave-one-out cross-validation method. Building upon the theory of Lu and Su (2015), we investigate the large sample properties of CSA and show the asymptotic optimality in the sense of Li (1987). We check the finite sample performance via Monte Carlo simulations and empirical applications.