Ping Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ping Sun has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Haoyue Lin
School of Mathematics and Statistics, Qingdao University, Qingdao 266071, China
1 shared publication - Hongwei Gao
Qingdao University
1 shared publication - Hui Jiang
Office of Discipline Development, Qingdao University, Qingdao 266071, China
1 shared publication - Yang Yu
School of Mathematics and Statistics, Qingdao University, No. 308 Ningxia Road, Qingdao 266071, China
1 shared publication - Ye Gao
School of Economics and Management, Harbin University of Science and Technology, No. 4 Linyuan Road, Nangang District, Harbin 150080, China
1 shared publication - Yeming Dai
School of Business, Qingdao University, Qingdao 266071, China
1 shared publication
Latest Publications
- Open Access
- 3 November 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (21) , 4007
Stable Partitions in Networks Under Symmetric Neighborhood-Composition Costs
We study changes in group membership on a fixed network. Link costs are symmetric, with the larger of the two neighborhood adjustments applied to both players. A stable partition is reachable through a finite sequence of best responses and allows no player to lower their cost by moving to another group. On a star with at least two group labels, the stable structure depends on a single threshold. Above it, all players belong to one group. Below it, the center is alone and all peripheral players belong to another group. At the threshold, both forms allow no profitable move, and we identify the initial partitions from which each is reachable. On a complete network with two group labels, explicit thresholds determine the stable difference between group sizes. At threshold values, this difference also depends on the initial partition. Compared with the asymmetric model, our rule permits stable separation on a star and larger differences in group sizes on a complete network under the same conditions.
- 3 November 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (21) , 4007
Open AccessStable Partitions in Networks Under Symmetric Neighborhood-Composition Costs
We study changes in group membership on a fixed network. Link costs are symmetric, with the larger of the two neighborhood adjustments applied to both players. A stable partition is reachable through a finite sequence of best responses and allows no player to lower their cost by moving to another group. On a star with at least two group labels, the stable structure depends on a single threshold. Above it, all players belong to one group. Below it, the center is alone and all peripheral players belong to another group. At the threshold, both forms allow no profitable move, and we identify the initial partitions from which each is reachable. On a complete network with two group labels, explicit thresholds determine the stable difference between group sizes. At threshold values, this difference also depends on the initial partition. Compared with the asymmetric model, our rule permits stable separation on a star and larger differences in group sizes on a complete network under the same conditions.
- Open Access
- 15 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (12) , 2140
User-Centric Analysis of Time-Consistent Strategies in Car-Sharing and Rental Platforms
The rapid growth of the sharing economy has improved resource utilization in car-sharing, yet it has also sharpened market competition and diversified user demand. A persistent obstacle is the low coordination efficiency between asset-heavy operating companies and traffic-driven platforms, whose misaligned objectives waste social resources. This paper uses differential game theory to analyze their dynamic coordination strategies and benefit allocation mechanisms. The Nerlove–Arrow model captures the evolution of brand goodwill, while the company’s decisions on station layout, vehicle dispatch, and pricing, together with the platform’s advertising investment, form the core decision variables in a two-party game framework linking the asset side and the traffic side. Compared with the non-cooperative Nash equilibrium, the cooperative mode removes the double marginalization effect, strengthens the investment incentives of both parties, and raises the system’s steady-state goodwill and total profit, achieving a Pareto improvement. To ground the cooperative framework in rigorous theory, we supply a verification theorem confirming that the linear candidate value functions satisfy the Hamilton–Jacobi–Bellman equations over the entire admissible state space. A formal proof of instantaneous rationality ensures that neither party falls into a cooperation trap on the horizon , and the asymptotic stability of the steady-state goodwill trajectory is established. We further endogenize the revenue-sharing coefficient through a generalized Nash bargaining model that admits asymmetric bargaining structures, and introduce a Stackelberg leadership benchmark as a third comparative regime. Sensitivity analyses with respect to the discount rate and user heterogeneity confirm the robustness of the findings. A dedicated discussion section bridges the gap between idealized parameterization and data-driven calibration, describing practical pathways via A/B testing, user churn metrics, and econometric estimation of demand parameters. The results offer a scientific decision-making reference for strategic cooperation in the car-sharing industry.- 15 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (12) , 2140
Open AccessUser-Centric Analysis of Time-Consistent Strategies in Car-Sharing and Rental Platforms
The rapid growth of the sharing economy has improved resource utilization in car-sharing, yet it has also sharpened market competition and diversified user demand. A persistent obstacle is the low coordination efficiency between asset-heavy operating companies and traffic-driven platforms, whose misaligned objectives waste social resources. This paper uses differential game theory to analyze their dynamic coordination strategies and benefit allocation mechanisms. The Nerlove–Arrow model captures the evolution of brand goodwill, while the company’s decisions on station layout, vehicle dispatch, and pricing, together with the platform’s advertising investment, form the core decision variables in a two-party game framework linking the asset side and the traffic side. Compared with the non-cooperative Nash equilibrium, the cooperative mode removes the double marginalization effect, strengthens the investment incentives of both parties, and raises the system’s steady-state goodwill and total profit, achieving a Pareto improvement. To ground the cooperative framework in rigorous theory, we supply a verification theorem confirming that the linear candidate value functions satisfy the Hamilton–Jacobi–Bellman equations over the entire admissible state space. A formal proof of instantaneous rationality ensures that neither party falls into a cooperation trap on the horizon , and the asymptotic stability of the steady-state goodwill trajectory is established. We further endogenize the revenue-sharing coefficient through a generalized Nash bargaining model that admits asymmetric bargaining structures, and introduce a Stackelberg leadership benchmark as a third comparative regime. Sensitivity analyses with respect to the discount rate and user heterogeneity confirm the robustness of the findings. A dedicated discussion section bridges the gap between idealized parameterization and data-driven calibration, describing practical pathways via A/B testing, user churn metrics, and econometric estimation of demand parameters. The results offer a scientific decision-making reference for strategic cooperation in the car-sharing industry.