Network manipulation algorithm based on inexact alternating minimization
David Müller () and
Vladimir Shikhman ()
Additional contact information
David Müller: Chemnitz University of Technology
Vladimir Shikhman: Chemnitz University of Technology
Computational Management Science, 2022, vol. 19, issue 4, No 4, 627-664
Abstract:
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.
Keywords: Network manipulation; Inexact alternating minimization; Discrete choice; Strong convexity; 90C25; 90C35; 90C90 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10287-022-00429-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
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:spr:comgts:v:19:y:2022:i:4:d:10.1007_s10287-022-00429-9
Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2
DOI: 10.1007/s10287-022-00429-9
Access Statistics for this article
Computational Management Science is currently edited by Ruediger Schultz
More articles in Computational Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().