IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v19y2022i4d10.1007_s10287-022-00429-9.html
   My bibliography  Save this article

Network manipulation algorithm based on inexact alternating minimization

Author

Listed:
  • David Müller

    (Chemnitz University of Technology)

  • Vladimir Shikhman

    (Chemnitz University of Technology)

Abstract

In this paper, we present a network manipulation algorithm based on an alternating minimization scheme from Nesterov (Soft Comput 1–12, 2020). In our context, the alternative process mimics the natural behavior of agents and organizations operating on a network. By selecting starting distributions, the organizations determine the short-term dynamics of the network. While choosing an organization in accordance with their manipulation goals, agents are prone to errors. This rational inattentive behavior leads to discrete choice probabilities. We extend the analysis of our algorithm to the inexact case, where the corresponding subproblems can only be solved with numerical inaccuracies. The parameters reflecting the imperfect behavior of agents and the credibility of organizations, as well as the condition number of the network transition matrix have a significant impact on the convergence of our algorithm. Namely, they turn out not only to improve the rate of convergence, but also to reduce the accumulated errors. From the mathematical perspective, this is due to the induced strong convexity of an appropriate potential function.

Suggested Citation

  • David Müller & Vladimir Shikhman, 2022. "Network manipulation algorithm based on inexact alternating minimization," Computational Management Science, Springer, vol. 19(4), pages 627-664, October.
    • Handle: RePEc:spr:comgts:v:19:y:2022:i:4:d:10.1007_s10287-022-00429-9
    DOI: 10.1007/s10287-022-00429-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-022-00429-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10287-022-00429-9?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fã–Rster, Manuel & Mauleon, Ana & Vannetelbosch, Vincent J., 2016. "Trust and manipulation in social networks," Network Science, Cambridge University Press, vol. 4(2), pages 216-243, June.
    2. Mogens Fosgerau & Emerson Melo & André de Palma & Matthew Shum, 2020. "Discrete Choice And Rational Inattention: A General Equivalence Result," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 61(4), pages 1569-1589, November.
    3. Borsch-Supan, Axel & Hajivassiliou, Vassilis A., 1993. "Smooth unbiased multivariate probability simulators for maximum likelihood estimation of limited dependent variable models," Journal of Econometrics, Elsevier, vol. 58(3), pages 347-368, August.
    4. Daniel McFadden & Kenneth Train, 2000. "Mixed MNL models for discrete response," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 15(5), pages 447-470.
    5. Daron Acemoglu & Asuman Ozdaglar, 2011. "Opinion Dynamics and Learning in Social Networks," Dynamic Games and Applications, Springer, vol. 1(1), pages 3-49, March.
    6. Train,Kenneth E., 2009. "Discrete Choice Methods with Simulation," Cambridge Books, Cambridge University Press, number 9780521766555.
    7. Yurii Nesterov, 2018. "Lectures on Convex Optimization," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-91578-4, September.
    8. Wen, Chieh-Hua & Koppelman, Frank S., 2001. "The generalized nested logit model," Transportation Research Part B: Methodological, Elsevier, vol. 35(7), pages 627-641, August.
    9. NESTEROV, Yu., 2005. "Smooth minimization of non-smooth functions," LIDAM Reprints CORE 1819, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. David Muller & Yurii Nesterov & Vladimir Shikhman, 2021. "Dynamic pricing under nested logit demand," Papers 2101.04486, arXiv.org.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Paleti, Rajesh, 2018. "Generalized multinomial probit Model: Accommodating constrained random parameters," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 248-262.
    2. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    3. Peter Davis & Pasquale Schiraldi, 2014. "The flexible coefficient multinomial logit (FC-MNL) model of demand for differentiated products," RAND Journal of Economics, RAND Corporation, vol. 45(1), pages 32-63, March.
    4. Emerson Melo, 2021. "Learning in Random Utility Models Via Online Decision Problems," Papers 2112.10993, arXiv.org, revised Aug 2022.
    5. José-Benito Pérez-López & Margarita Novales & Francisco-Alberto Varela-García & Alfonso Orro, 2020. "Residential Location Econometric Choice Modeling with Irregular Zoning: Common Border Spatial Correlation Metric," Networks and Spatial Economics, Springer, vol. 20(3), pages 785-802, September.
    6. Tinessa, Fiore & Marzano, Vittorio & Papola, Andrea, 2020. "Mixing distributions of tastes with a Combination of Nested Logit (CoNL) kernel: Formulation and performance analysis," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 1-23.
    7. Heiss, Florian & Winschel, Viktor, 2006. "Estimation with Numerical Integration on Sparse Grids," Discussion Papers in Economics 916, University of Munich, Department of Economics.
    8. Shi, Haolun & Yin, Guosheng, 2018. "Boosting conditional logit model," Journal of choice modelling, Elsevier, vol. 26(C), pages 48-63.
    9. Kiran Tomlinson & Johan Ugander & Austin R. Benson, 2021. "Choice Set Confounding in Discrete Choice," Papers 2105.07959, arXiv.org, revised Aug 2021.
    10. Lemp, Jason D. & Kockelman, Kara M., 2012. "Strategic sampling for large choice sets in estimation and application," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(3), pages 602-613.
    11. Knies, Austin & Lorca, Jorge & Melo, Emerson, 2022. "A recursive logit model with choice aversion and its application to transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 47-71.
    12. Cherchi, Elisabetta & Guevara, Cristian Angelo, 2012. "A Monte Carlo experiment to analyze the curse of dimensionality in estimating random coefficients models with a full variance–covariance matrix," Transportation Research Part B: Methodological, Elsevier, vol. 46(2), pages 321-332.
    13. Taro Ohdoko & Satoru Komatsu, 2023. "Integrating a Pareto-Distributed Scale into the Mixed Logit Model: A Mathematical Concept," Mathematics, MDPI, vol. 11(23), pages 1-22, November.
    14. Stephane Hess & Mark Fowler & Thomas Adler & Aniss Bahreinian, 2012. "A joint model for vehicle type and fuel type choice: evidence from a cross-nested logit study," Transportation, Springer, vol. 39(3), pages 593-625, May.
    15. David Muller & Yurii Nesterov & Vladimir Shikhman, 2021. "Dynamic pricing under nested logit demand," Papers 2101.04486, arXiv.org.
    16. Emerson Melo, 2022. "On the uniqueness of quantal response equilibria and its application to network games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 74(3), pages 681-725, October.
    17. Chiou, Lesley & Walker, Joan L., 2007. "Masking identification of discrete choice models under simulation methods," Journal of Econometrics, Elsevier, vol. 141(2), pages 683-703, December.
    18. Tinessa, Fiore, 2021. "Closed-form random utility models with mixture distributions of random utilities: Exploring finite mixtures of qGEV models," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 262-288.
    19. Stephane Hess & Denis Bolduc & John Polak, 2010. "Random covariance heterogeneity in discrete choice models," Transportation, Springer, vol. 37(3), pages 391-411, May.
    20. Heiss, Florian & Winschel, Viktor, 2008. "Likelihood approximation by numerical integration on sparse grids," Journal of Econometrics, Elsevier, vol. 144(1), pages 62-80, May.

    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:spr:comgts:v:19:y:2022:i:4:d:10.1007_s10287-022-00429-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.