Smoothed maximum score estimator

When modelling discrete choice model, it is always assumed that the choice is determined by the comparison of the underlying latent utility. Denote the population of the agents as T, the common choice set for each agent as C . For agent t∈T , denote her choice as y_t,i , which is equal to 1 if choice i∈C is chosen and 0 otherwise. Assume the linearity of the parameters and the additivity of the error term: for an agent t∈T ,

y_t,i = 1 ↔ x_t,iβ + ε_t,i > x_t,jβ + ε_t,j, ∀ j ≠ i and j ∈ C

where x_t,i and x_t,j are the q- dimensional observable covariates about the agent and the choice, and ε_t,i and ε_t,j are the decision errors caused by some cognitive reasons or information incompleteness. The construction of the observable covariates is very general. For instance, if C is a set of different brands of coffee, then x_t,i includes the characteristics both of the agent t , such as age, gender, income and ethnicity, and of the coffee i , such as price, taste and whether it is local or imported.

Manski (1975) proposed a non-parametric model to estimate the parameters. In this model, denote the number of the elements of the choice set as J , the total number of the agents as N , and W ( J - 1) > W (J - 2) > ... > W (1) > W (0) is a sequence of real numbers. The Maximum Score (MS) estimator² is defined as:

Here, ( ∑ j ∈ C , j ≠ i 1 ( x t , i b > x t , j b ) ) is the ranking of the certainty part of the underlying utility of choosing i . Under certain conditions, the maximum score estimator can be weak consistent, but its asymptotic property will be very complicated. This issue mainly comes from the non-smooth of the objective function. Horowitz (1992) proposed a Smoothed Maximum Score (SMS) estimator which has much better asymptotic property. The basic idea of this new estimator is just to replace the non-smoothed weight function W ( ∑ j ∈ C , j ≠ i 1 ( x t , i b > x t , j b ) ) with a smoothed one. Define a smooth kernel function K satisfying following conditions:

(1) |K(·)| is bounded over R ;

(2) lim u → − ∞ K ( u ) = 0 a n d lim u → + ∞ K ( u ) = 1  ;

(3) K ˙ ( u ) = K ˙ ( − u )

Here, the kernel function is analogous to a CDF whose PDF is symmetric around 0. Then, the SMS estimator is defined as:

b ^ S M S = a r g max b 1 N ∑ t = 1 N ∑ i = 1 J y t , i ∑ j ∈ C , j ≠ i K ( X t , i b − x t , j b / h N )

where ( h N , N = 1 , 2 , . . . ) is a sequence of strictly positive numbers and lim N → + ∞ h N = 0 . Here, the intuition is the same with the construction of the traditional MS estimator: it is more likely to choose the choice with higher certainty part of the utility. Under certain conditions, SMS estimator is consistent, and more importantly, it has an asymptotic normal distribution. Therefore, all the testing and inference based on asymptotic distribution can be implemented.