IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i1p485-507.html
   My bibliography  Save this article

Discrete Choice Prox-Functions on the Simplex

Author

Listed:
  • David Müller

    (Department of Mathematics, Chemnitz University of Technology, 09126 Chemnitz, Germany)

  • Yurii Nesterov

    (Center for Operations Research and Econometrics, Catholic University of Louvain, 1348 Louvain-la-Neuve, Belgium)

  • Vladimir Shikhman

    (Department of Mathematics, Chemnitz University of Technology, 09126 Chemnitz, Germany)

Abstract

We derive new prox-functions on the simplex from additive random utility models of discrete choice. They are convex conjugates of the corresponding surplus functions. In particular, we explicitly derive the convexity parameter of discrete choice prox-functions associated with generalized extreme value models, and specifically with generalized nested logit models. Incorporated into subgradient schemes, discrete choice prox-functions lead to a probabilistic interpretations of the iteration steps. As illustration, we discuss an economic application of discrete choice prox-functions in consumer theory. The dual averaging scheme from convex programming adjusts demand within a consumption cycle.

Suggested Citation

  • David Müller & Yurii Nesterov & Vladimir Shikhman, 2022. "Discrete Choice Prox-Functions on the Simplex," Mathematics of Operations Research, INFORMS, vol. 47(1), pages 485-507, February.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:1:p:485-507
    DOI: 10.1287/moor.2021.1136
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1136
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1136?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormoor:v:47:y:2022:i:1:p:485-507. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.