Improved <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi>x</mml:mi></mml:math>-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks

Tanınmış, Kübra; Aras, Necatı; Altınel, İ. Kuban

doi:10.1016/j.ejor.2021.05.008

Cited by 11 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assuming that cultural work is disseminated in a closed social network consisting of N individuals, the cultural dissemination state transfer is shown in Figure 1 [22]. The cultural transmission rules of literary works are elaborated by combining the cultural transmission state transfer in the figure.…”

Section: Assumptions and Establishment Of Models For The Disseminatio...mentioning

confidence: 99%

Study on the Dissemination Path of Chinese Modern and Contemporary Literature in the Background of the Internet

2023

Applied Mathematics and Nonlinear Sciences

View full text Add to dashboard Cite

This paper first establishes a literary communication SICR model on the basis of the communication SICR model. It adopts cultural communication state transfer to construct a social network composed of N-closed individuals. Secondly, the dissemination threshold when the model reaches a stable state is discussed from the beginning and end of the literary work dissemination process. Finally, numerical simulation research using MATLAB software is used to analyze the propagation process of modern Chinese literary works, with examples provided. The results show that the number of literary ignoramuses (I) transformed into literary propagators (S) gradually rises when the initial values are S(t)=8915, I(t) =3414, C 0 =5288, and R 0 =850 in the dissemination process of X novels in Fictum, a Chinese online literature, and reaches the dissemination threshold when the dissemination rate reaches 0.856. This paper aims to provide a guide for advancing the advancement of modern and contemporary Chinese literature to the outside world and advocating for cultural dissemination.

show abstract

Section: Assumptions and Establishment Of Models For The Disseminatio...mentioning

confidence: 99%

Study on the Dissemination Path of Chinese Modern and Contemporary Literature in the Background of the Internet

2023

Applied Mathematics and Nonlinear Sciences

View full text Add to dashboard Cite

show abstract

“…These algorithms are finitely convergent when the leader variables are restricted to take binary values. Tanınmış et al (2020) improve the algorithm of Tang et al (2016) for the binary bilevel problem case, using a covering based reformulation of the problem instead of a duality based one. Fischetti et al (2019) address IGs that satisfy an assumption called downward monotonicity.…”

Section: Previous and Related Workmentioning

confidence: 99%

A branch-and-cut algorithm for submodular interdiction games

Tanınmış¹,

Sinnl²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Many relevant applications from diverse areas such as marketing, wildlife conservation or defending critical infrastructure can be modeled as interdiction games. In this work, we introduce interdiction games whose objective is a monotone and submodular set function. Given a ground set of items, the leader interdicts the usage of some of the items of the follower in order to minimize the objective value achievable by the follower, who seeks to maximize a submodular set function over the uninterdicted items subject to knapsack constraints.We propose an exact branch-and-cut algorithm for these kind of interdiction games. The algorithm is based on interdiction cuts which allow to capture the followers objective function value for a given interdiction decision of the leader and exploit the submodularity of the objective function. We also present extensions and liftings of these cuts and discuss additional preprocessing procedures.We test our solution framework on the weighted maximal covering interdiction game and the bipartite inference interdiction game. For both applications, the improved variants of our interdiction cut perform significantly better than its basic version. For the weighted maximal covering interdiction game for which a mixed-integer bilevel linear programming (MIBLP) formulation is available, we compare the results with those of a state-of-the-art MIBLP solver. While the MIBLP solver yields a minimum of 54% optimality gap within one hour, our best branch-and-cut setting solves all but 4 of 108 instances to optimality with a maximum of 3% gap among unsolved ones.

show abstract

Optimization with Learning in Sequential Bilevel Interdiction Problems

Borrero

2022

Encyclopedia of Optimization

View full text Add to dashboard Cite

Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks

Cited by 11 publications

References 26 publications

Study on the Dissemination Path of Chinese Modern and Contemporary Literature in the Background of the Internet

Study on the Dissemination Path of Chinese Modern and Contemporary Literature in the Background of the Internet

A branch-and-cut algorithm for submodular interdiction games

Optimization with Learning in Sequential Bilevel Interdiction Problems

Contact Info

Product

Resources

About