数学最新文献

{"title":"Partitioning vertices of graphs into paths of the same length","authors":"Oleg Duginov ,&nbsp;Dmitriy Malyshev ,&nbsp;Dmitriy Mokeev","doi":"10.1016/j.dam.2025.04.054","DOIUrl":"10.1016/j.dam.2025.04.054","url":null,"abstract":"<div><div>Given a graph, the (<em>induced</em>) <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span><em>-partition problem</em> is to decide whether its vertex set can be partitioned into subsets, each of which induces (the <span><math><mi>k</mi></math></span>-path) a <span><math><mi>k</mi></math></span>-vertex subgraph with a Hamiltonian path. We show that these problems are NP-complete for planar subcubic bipartite <span><math><mrow><mo>(</mo><msub><mrow><mi>H</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>H</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>H</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>)</mo></mrow></math></span>-free graphs of girth <span><math><mi>g</mi></math></span>, for any <span><math><mrow><mi>k</mi><mo>,</mo><mi>g</mi><mo>≥</mo><mn>3</mn><mo>,</mo><mi>l</mi><mo>≥</mo><mn>1</mn></mrow></math></span>, where <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is obtained by joining central vertices in two copies of <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span> with <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span>. We show that the <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span>-partition (induced <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span>-partition) problem is NP-complete for split graphs and any <span><math><mrow><mi>k</mi><mo>≥</mo><mn>5</mn></mrow></math></span>, chordal graphs and any <span><math><mrow><mi>k</mi><mo>≥</mo><mn>4</mn></mrow></math></span> (any <span><math><mrow><mi>k</mi><mo>≥</mo><mn>3</mn></mrow></math></span>), line graphs of planar bipartite graphs and any <span><math><mrow><mi>k</mi><mo>≥</mo><mn>5</mn></mrow></math></span> (any <span><math><mrow><mi>k</mi><mo>≥</mo><mn>3</mn></mrow></math></span>). We show that the <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>-partition and, for any <span><math><mrow><mi>k</mi><mo>≥</mo><mn>5</mn></mrow></math></span>, induced <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span>-partition problems, restricted to split graphs, are polynomial. Additionally, we prove NP-completeness for the optimization version of the induced <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span>-partition problem and split graphs.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"373 ","pages":"Pages 179-195"},"PeriodicalIF":1.0,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Finite Element Approximation of Lyapunov Equations Related to Parabolic Stochastic PDEs","authors":"Adam Andersson,&nbsp;Annika Lang,&nbsp;Andreas Petersson,&nbsp;Leander Schroer","doi":"10.1007/s00245-025-10260-8","DOIUrl":"10.1007/s00245-025-10260-8","url":null,"abstract":"<div><p>A numerical analysis for the fully discrete approximation of an operator Lyapunov equation related to linear stochastic partial differential equations (SPDEs) driven by multiplicative noise is considered. The discretization of the Lyapunov equation in space is given by finite elements and in time by a semiimplicit Euler scheme. The main result is the derivation of the rate of convergence in operator norm. Moreover, it is shown that the solution of the equation provides a representation of a quadratic and path dependent functional of the SPDE solution. This fact yields a deterministic numerical method to compute such functionals. As a secondary result, weak error rates are established for a fully discrete finite element approximation of the SPDE with respect to this functional. This is obtained as a consequence of the approximation analysis of the Lyapunov equation. It is the first weak convergence analysis for fully discrete finite element approximations of SPDEs driven by multiplicative noise that obtains double the strong rate of convergence, especially for path dependent functionals and smooth spatial noise. Numerical experiments illustrate the results empirically, and it is demonstrated that the deterministic method has advantages over Monte Carlo sampling in a stability context.</p></div>","PeriodicalId":55566,"journal":{"name":"Applied Mathematics and Optimization","volume":"91 3","pages":""},"PeriodicalIF":1.6,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00245-025-10260-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel meshfree method for free vibration behavior of the functionally graded carbon nanotube-reinforced composite plates using a new shear deformation theory","authors":"P.T. Hung ,&nbsp;Chien H. Thai ,&nbsp;P. Phung-Van","doi":"10.1016/j.camwa.2025.04.023","DOIUrl":"10.1016/j.camwa.2025.04.023","url":null,"abstract":"<div><div>This study investigates the free vibration behavior of functionally graded carbon nanotube-reinforced composite (FG-CNTRC) plates using a novel approach. This approach employs Chebyshev polynomials to represent both new shear deformation theory and moving Kriging meshfree shape functions. The proposed theory, termed the third-order Chebyshev shear deformation theory (TCSDT), automatically fulfills the zero of shear stresses on the top and bottom surfaces. To improve the accuracy of the solution, Chebyshev polynomials are replaced by the traditional polynomials to construct a new set of Chebyshev-based moving Kriging meshfree shape functions. Besides, the FG-CNTRC plate consists of a matrix material reinforced with carbon nanotubes (CNTs), distributed in a graded manner along the thickness direction, with four distribution types: uniform (FG-UD), V distribution (FG-V), O distribution (FG-O), and X distribution (FG-X). The equilibrium equations are derived using TCSDT in conjunction with the principle of virtual work and are subsequently solved using the Chebyshev moving Kriging (CMK) meshfree method. The numerical outcomes are compared with the reference solution, showing good agreement. Furthermore, the impact of the CNTs volume fraction, CNTs distribution, and geometry on the free vibration of the FG-CNTRC plates are examined.</div></div>","PeriodicalId":55218,"journal":{"name":"Computers & Mathematics with Applications","volume":"189 ","pages":"Pages 208-224"},"PeriodicalIF":2.9,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143898485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Jam traffic pattern of a multi-phase lattice hydrodynamic model integrating a continuous self-stabilizing control protocol to boycott the malicious cyber-attacks","authors":"Cong Zhai ,&nbsp;Weitiao Wu ,&nbsp;Yingping Xiao ,&nbsp;Jiyong Zhang ,&nbsp;Min Zhai","doi":"10.1016/j.chaos.2025.116531","DOIUrl":"10.1016/j.chaos.2025.116531","url":null,"abstract":"<div><div>While connected-automated vehicles (CAVs) can share traffic data with external nodes through vehicle-vehicle or vehicle-infrastructure communication, the exoteric workshop communication setting makes the vehicles susceptible to cyber-attack interference, which will affect the normal information interaction between vehicles. Besides, in practice, the driver uses the accelerator, gear shift lever or brake pedal to accelerate and decelerate the vehicle, whereas the complex piecewise acceleration process is negligible in existing works. In doing so, we use historical traffic information to compensate for the missing core data caused by malicious cyber-attacks. We then propose a novel multi-phase lattice hydrodynamics model considering malicious cyber-attacks. A switch continuous self-stabilizing security control protocol is embedded to reinforce the steadiness of traffic flow. The typical optimal velocity function, which frequently serves as a basic hyperbolic tangent function, is swapped with a two-stage (three-phase) optimal velocity function to elucidate the intricate three-phase traffic flow system. Following the linear stability theorem, the critical stability criteria for the new model are identified. The outcome reveals that the cyber-attack intensity and control gain coefficient have profound effects on the steadiness of traffic flow, and the stage of phase transition is determined by what amount of turning points are contained in the optimal velocity function. The modified Korteweg–de Vries (mKdV) equation that indicates the density wave in a bottleneck area is established with the aid of nonlinear stability analysis and the associated analytical solution is obtained. Numerical studies have been conducted under periodic boundary circumstances to verify the correctness of the mathematical analysis.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"197 ","pages":"Article 116531"},"PeriodicalIF":5.3,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the Δ-edge stability number of graphs","authors":"Saieed Akbari ,&nbsp;Reza Hosseini Dolatabadi ,&nbsp;Mohsen Jamaali ,&nbsp;Sandi Klavžar ,&nbsp;Nazanin Movarraei","doi":"10.1016/j.ejc.2025.104167","DOIUrl":"10.1016/j.ejc.2025.104167","url":null,"abstract":"<div><div>The <span><math><mi>Δ</mi></math></span>-edge stability number <span><math><mrow><msub><mrow><mi>es</mi></mrow><mrow><mi>Δ</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> of a graph <span><math><mi>G</mi></math></span> is the minimum number of edges of <span><math><mi>G</mi></math></span> whose removal results in a subgraph <span><math><mi>H</mi></math></span> with <span><math><mrow><mi>Δ</mi><mrow><mo>(</mo><mi>H</mi><mo>)</mo></mrow><mo>=</mo><mi>Δ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>−</mo><mn>1</mn></mrow></math></span>. Sets whose removal results in a subgraph with smaller maximum degree are called mitigating sets. It is proved that there always exists a mitigating set which induces a disjoint union of paths of order 2 or 3. Minimum mitigating sets which induce matchings are characterized. It is proved that to obtain an upper bound of the form <span><math><mrow><msub><mrow><mi>es</mi></mrow><mrow><mi>Δ</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≤</mo><mi>c</mi><mrow><mo>|</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>|</mo></mrow></mrow></math></span> for an arbitrary graph <span><math><mi>G</mi></math></span> of given maximum degree <span><math><mi>Δ</mi></math></span>, where <span><math><mi>c</mi></math></span> is a given constant, it suffices to prove the bound for <span><math><mi>Δ</mi></math></span>-regular graphs. Sharp upper bounds of this form are derived for regular graphs. It is proved that if <span><math><mrow><mi>Δ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≥</mo><mfrac><mrow><mrow><mo>|</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>|</mo></mrow><mo>−</mo><mn>2</mn></mrow><mrow><mn>3</mn></mrow></mfrac></mrow></math></span> or the induced subgraph on maximum degree vertices has a <span><math><mrow><mi>Δ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span>-edge coloring, then <span><math><mrow><msub><mrow><mi>es</mi></mrow><mrow><mi>Δ</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≤</mo><mrow><mo>⌈</mo><mrow><mo>|</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>|</mo></mrow><mo>/</mo><mn>2</mn><mo>⌉</mo></mrow></mrow></math></span>.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"127 ","pages":"Article 104167"},"PeriodicalIF":1.0,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143898757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Comparing width parameters on graph classes","authors":"Nick Brettell ,&nbsp;Andrea Munaro ,&nbsp;Daniël Paulusma ,&nbsp;Shizhou Yang","doi":"10.1016/j.ejc.2025.104163","DOIUrl":"10.1016/j.ejc.2025.104163","url":null,"abstract":"<div><div>We study how the relationship between non-equivalent width parameters changes once we restrict to some special graph class. As width parameters we consider treewidth, clique-width, twin-width, mim-width, sim-width and tree-independence number, whereas as graph classes we consider <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>t</mi></mrow></msub></math></span>-subgraph-free graphs, line graphs and their common superclass, for <span><math><mrow><mi>t</mi><mo>≥</mo><mn>3</mn></mrow></math></span>, of <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>t</mi></mrow></msub></math></span>-free graphs. For <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>t</mi></mrow></msub></math></span>-subgraph-free graphs, we extend a known result of Gurski and Wanke (2000) and provide a complete comparison, showing in particular that treewidth, clique-width, mim-width, sim-width and tree-independence number are all equivalent. For line graphs, we extend a result of Gurski and Wanke (2007) and also provide a complete comparison, showing in particular that clique-width, mim-width, sim-width and tree-independence number are all equivalent, and bounded if and only if the class of root graphs has bounded treewidth. For <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>t</mi></mrow></msub></math></span>-free graphs, we provide an almost-complete comparison, leaving open only one missing case. We show in particular that <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>t</mi></mrow></msub></math></span>-free graphs of bounded mim-width have bounded tree-independence number, and obtain structural and algorithmic consequences of this result, such as a proof of a special case of a recent conjecture of Dallard, Milanič and Štorgel. Finally, we consider the question of whether boundedness of a certain width parameter is preserved under graph powers. We show that this question has a positive answer for sim-width precisely in the case of odd powers.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"127 ","pages":"Article 104163"},"PeriodicalIF":1.0,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143898756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A linearized time stepping scheme for finite elements applied to Gray-Scott model","authors":"M.S. Daoussa Haggar ,&nbsp;K. Mahamat Malloum ,&nbsp;J.M. Fokam ,&nbsp;M. Mbehou","doi":"10.1016/j.camwa.2025.04.026","DOIUrl":"10.1016/j.camwa.2025.04.026","url":null,"abstract":"<div><div>This paper describes a numerical scheme for solving a reaction-diffusion system, specifically the Gray-Scott model. The scheme is a two-step process, combining the Crank-Nicolson method in the first step with the second-order backward differentiation formula in the second step. This combination ensures unconditional stability in both <span><math><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> and <span><math><msup><mrow><mi>H</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span>-norms and allows for optimal error estimates. The scheme's efficiency is further enhanced by a temporal-spatial error splitting technique, enabling the derivation of error estimates without any restrictions on meshes size steps. By dividing the error into temporal and spatial components, the unconditional convergence result is deduced. The regularity of a time-discrete system is established through the analysis of the temporal error. Additionally, the classical Ritz projection is used to achieve the optimal spatial error in the <span><math><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span>-norm, which is crucial for eliminating the constraint of Δ<em>t</em>. Since the spatial error is not dependent on the time step, the boundedness of the numerical solution in <span><math><msup><mrow><mi>L</mi></mrow><mrow><mo>∞</mo></mrow></msup></math></span>-norm follows an inverse inequality immediately without any restriction on the grid mesh.</div></div>","PeriodicalId":55218,"journal":{"name":"Computers & Mathematics with Applications","volume":"191 ","pages":"Pages 129-143"},"PeriodicalIF":2.9,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"State-transition mechanisms for (2+1)-dimensional Sawada-Kotera equation with the variable coefficients in plasma physics and fluid dynamics","authors":"Xuemin Yao ,&nbsp;Junfei Zhao ,&nbsp;Rui Liang","doi":"10.1016/j.chaos.2025.116485","DOIUrl":"10.1016/j.chaos.2025.116485","url":null,"abstract":"<div><div>In this paper, we investigate the linear and tortuous transformed nonlinear waves in the (2+1)-dimensional Sawada-Kotera equation with variable coefficients, which may provide valuable theoretical insights for experimental design in plasma physics and fluid dynamics. Through characteristic line analysis and state transition conditions, the general transformed waves under various inhomogeneous parameters are modulated. The results demonstrate that the selected inhomogeneous parameters have minimal impact on the isolation and oscillatory characteristics of the transformed waves. Furthermore, we present a series of S-type tortuous transformed waves with identical inhomogeneous coefficients corresponding to different wave number ratios in the (<span><math><mi>x</mi></math></span>-<span><math><mi>t</mi></math></span>) plane, highlighting that the wave number ratio significantly influences the locality and oscillatory nature. Additionally, a novel type of tortuous M-shaped transformed wave, characterized by an initial intersection followed by a parallel configuration, is also reported. Our findings indicate that the wave number ratio plays a crucial role in shaping the dynamic characteristics of tortuous transformed waves, including their shape, velocity, and other properties.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"197 ","pages":"Article 116485"},"PeriodicalIF":5.3,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Community reciprocity promotes cooperation in a network evolutionary prisoner’s dilemma game","authors":"Lin Li,&nbsp;Jingyu Lv,&nbsp;Lili Ma,&nbsp;Jing Ruan","doi":"10.1016/j.amc.2025.129497","DOIUrl":"10.1016/j.amc.2025.129497","url":null,"abstract":"<div><div>Community structure is one of the most common features of complex networks and plays a crucial role in the game of strategy during an evolutionary process. Previous works focus on its physical characteristics of high cohesion and low coupling, we extend the existing research, by taking into consideration the capacity of communities to effectively manage and allocate resources through collective action, from a logical functional perspective. Based on the Prisoner’s Dilemma Game, we develop a new evolutionary model featuring community reciprocity. In particular, we assume that players could obtain the shared resources contributed by cooperators from communities with a certain probability, and the quantity of reciprocal resources players could reap depends on their positions in the community. Through intensive simulations on two famous synthetic networks with built-in community structure, the results show that community structure can provide enhanced reciprocity and promote the evolution of cooperation. The way that cooperation prospers is by occupying nodes with more advantageous positions within the community. Besides, the clarity of community structure mediates the promoting effect of community reciprocity on cooperation.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"502 ","pages":"Article 129497"},"PeriodicalIF":3.5,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143898895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The evolution of cooperation under falsified payoff information","authors":"Wenhui Dai,&nbsp;Jianwei Wang,&nbsp;Fengyuan Yu,&nbsp;Wenshu Xu,&nbsp;Bofan Li","doi":"10.1016/j.chaos.2025.116463","DOIUrl":"10.1016/j.chaos.2025.116463","url":null,"abstract":"<div><div>Maximizing payoff is individuals’ pursuit during games, and thus payoff information profoundly affects individuals’ strategic choices. However, the privatization of payoff information provides individuals with opportunities for pretense and deception, and it is commonplace for individuals to induce their opponents to cooperate with them by declaring false payoff information in order to obtain a future advantage. This begs the question of how false payoff information disseminated by individuals for self-interested purposes affects humans’ strategy selection, and whether it inevitably has a negative impact on human cooperation. In view of this, this paper focuses on the impact of different deceivers, i.e., cooperative deceiver, defective deceiver, and dual-mode deceiver, on the evolution of cooperation, in the context that players can choose to declare false payoff information depending on their game situation. The results showed that all three types of deceivers can positively influence the evolution of cooperation, despite the self-interested initial intent of their deception, especially the dual-mode deceivers who most notably drove group cooperation by their flexibility in deceiving. In addition, compared to cooperative deceivers, defective deceivers perform better, i.e., defectors understate their payoff is more favorable to group cooperation than cooperators overstate their payoff. Moreover, in some of the tougher dilemmas, the defective deceivers can drive the group to achieve a reversal in the cooperation rate, which triggers a series of interesting and counterintuitive phenomena.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"197 ","pages":"Article 116463"},"PeriodicalIF":5.3,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143895461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}