On the tradeoff between computational simplicity and asymptotic properties in multivariate probit (Q1284839)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the tradeoff between computational simplicity and asymptotic properties in multivariate probit |
scientific article; zbMATH DE number 1279427
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the tradeoff between computational simplicity and asymptotic properties in multivariate probit |
scientific article; zbMATH DE number 1279427 |
Statements
On the tradeoff between computational simplicity and asymptotic properties in multivariate probit (English)
0 references
4 August 1999
0 references
efficiency
0 references
multivariate probit
0 references
quasi maximum likelihood
0 references
simulation
0 references
