Exact Computation of Maximum Rank Correlation Estimator

Youngki Shin and Zvezdomir Todorov

Department of Economics Working Papers from McMaster University

Abstract: In this paper we provide a computation algorithm to get a global solution for the maximum rank correlation estimator using the mixed integer programming (MIP) approach. We construct a new constrained optimization problem by transforming all indicator functions into binary parameters to be estimated and show that it is equivalent to the original problem. We also consider an application of the best subset rank prediction and show that the original optimization problem can be reformulated as MIP. We derive the non-asymptotic bound for the tail probability of the predictive performance measure. We investigate the performance of the MIP algorithm by an empirical example and Monte Carlo simulations

Keywords: mixed integer programming; finite sample property; maximum rank correlation; U-process (search for similar items in EconPapers)
JEL-codes: C14 C61 (search for similar items in EconPapers)
Pages: 24 pages
Date: 2021-01
New Economics Papers: this item is included in nep-ore
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://socialsciences.mcmaster.ca/econ/rsrch/papers/archive/2021-03.pdf (application/pdf)

Related works:
Journal Article: Exact computation of maximum rank correlation estimator (2021)
Working Paper: Exact Computation of Maximum Rank Correlation Estimator (2021)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:mcm:deptwp:2021-03

Access Statistics for this paper

More papers in Department of Economics Working Papers from McMaster University Contact information at EDIRC.
Bibliographic data for series maintained by ().