Network manipulation algorithm based on inexact alternating minimization
Year of publication: |
2022
|
---|---|
Authors: | Müller-Bender, David ; Shikhman, Vladimir |
Published in: |
Computational management science. - Heidelberg : Springer, ISSN 1619-6988, ZDB-ID 2107564-5. - Vol. 19.2022, 4, p. 627-664
|
Subject: | Discrete choice | Inexact alternating minimization | Network manipulation | Strong convexity | Theorie | Theory | Diskrete Entscheidung | Mathematische Optimierung | Mathematical programming | Netzwerk | Network | Algorithmus | Algorithm | Manipulation |
-
A divide and conquer algorithm for exploiting policy function monotonicity
Gordon, Grey, (2019)
-
Sequential estimation of dynamic programming models with unobserved heterogeneity
Kasahara, Hiroyuki, (2011)
-
An Algorithm for Assortment Optimization Under Parametric Discrete Choice Models
Mai, Tien, (2019)
- More ...
-
Criteria for efficiency in vector optimization
Guerra Vázquez, Francisco, (2009)
-
Algorithmic models of market equilibrium
Nesterov, Jurij Evgenʹevič, (2013)
-
On implicit functions in nonsmooth analysis
Dorsch, Dominik, (2013)
- More ...