IDEAS home Printed from https://ideas.repec.org/p/dra/wpaper/201401.html
   My bibliography  Save this paper

An Information-Loss-Minimizing Approach to Multinominal Alignment in Microsimulation Models

Author

Abstract

There exist a number of alignment methods. They typically address the binary case and they typically put special emphasis on one of the alternatives rather than treating all alternatives in a symmetric way (for a review, see Li & O’Donoghue, 2014). In this paper we propose a more general mathematical foundation of multinominal alignment. Meancorrection alignment is defined as a method that minimizes the information loss in the adjustment process. The analytical solution to the alignment problem is characterized and furthermore applied in deriving various properties for the method. It is demonstrated that there exits an algorithm called Bi-Proportional Scaling that converge to the solution of the problem. This is tested against two versions of the Newton-Raphson-algoritm, and it is demonstrated that it is at least twice as fast as these methods. Finally, it is argued, that the method is very easy to implement.

Suggested Citation

  • Peter Stephensen, 2014. "An Information-Loss-Minimizing Approach to Multinominal Alignment in Microsimulation Models," DREAM Working Paper Series 201401, Danish Rational Economic Agents Model, DREAM.
  • Handle: RePEc:dra:wpaper:201401
    Note: Conference paper for the European Meeting of the International Microsimulation Association
    as

    Download full text from publisher

    File URL: http://www.dreammodel.dk/pdf/N2014_01.pdf
    File Function: First version, 2014
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:dra:wpaper:201401. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Stephensen (email available below). General contact details of provider: https://edirc.repec.org/data/dreamdk.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.