• Title/Summary/Keyword: zero-sum

Search Result 38, Processing Time 0.074 seconds

How Do South Korean People View the US and Chinese National Influence?: Is Soft Power Zero-Sum?

  • Zhao, Xiaoyu
    • Asian Journal for Public Opinion Research
    • /
    • v.5 no.1
    • /
    • pp.15-40
    • /
    • 2017
  • This paper addresses the zero-sum of soft power against the backdrop of the rise of China and the relative "decline" of America. It attempts to find out that whether the "decline" of America's soft power is caused by the rise of China's soft power, and whether China's rise could guarantee with certainty the growth of soft power. In light of the particularity of South Korea, that is, its economy relies on China and its security relies on the US, this paper chooses South Korea as the entry point for the study. Based on the Pew data from a South Korean opinion poll, this paper conducts bivariate correlation and binary logistic regression respectively, to explore the existence of zero-sum "competitions" between China's and America's soft power.

Optimization of Destroyer Deployment for Effectively Detecting an SLBM based on a Two-Person Zero-Sum Game (2인 제로섬 게임 기반의 효과적인 SLBM 탐지를 위한 구축함 배치 최적화)

  • Lee, Jinho
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.1
    • /
    • pp.39-49
    • /
    • 2018
  • An SLBM (submarine-launched ballistic missile) seriously threatens the national security due to its stealthiness that makes it difficult to detect in advance. We consider a destroyer deployment optimization problem for effectively detecting an SLBM. An optimization model is based on the two-person zero-sum game in which an adversary determines the firing and arriving places with an appropriate trajectory that provides a low detection probability, and we establish a destroyer deployment plan that guarantees the possibly highest detection probability. The proposed two-person zero-sum game model can be solved with the corresponding linear programming model, and we perform computational studies with a randomly generated area and scenario and show the optimal mixed strategies for both the players in the game.

Regional allocation of carbon emissions in China based on zero sum gains data envelopment analysis model

  • Wen, Lei;Zhang, Er nv
    • Environmental Engineering Research
    • /
    • v.21 no.1
    • /
    • pp.91-98
    • /
    • 2016
  • Along with China's increasing share in global total $CO_2$ emissions, there is a necessity for China to shoulder large emission-mitigating responsibility. The appropriate allocation of $CO_2$ emission quotas can build up a solid foundation for future emissions trading. In views of originality, an optimized approach to determine $CO_2$ emissions allocation efficiency based on the zero sum gains data envelopment analysis (ZSG-DEA) method is proposed. This paper uses a non-radial ZSG-DEA model to allocate $CO_2$ emissions between different Chinese provinces by 2020 and treats $CO_2$ as the undesirable output variable. Through the calculation of efficiency allocation amounts of provincial $CO_2$ emissions, all provinces are on the ZSG-DEA efficiency frontier. The allocation results indicate that the cumulative optimal amounts of $CO_2$ emissions in 2020 were higher than the actual amounts in 13 provinces, and lower in other 17 provinces, and show that different provinces have to shoulder different mitigation burdens in terms of emission reduction.

On the Relationship between Zero-sums and Zero-divisors of Semirings

  • Hetzel, Andrew J.;Lufi, Rebeca V. Lewis
    • Kyungpook Mathematical Journal
    • /
    • v.49 no.2
    • /
    • pp.221-233
    • /
    • 2009
  • In this article, we generalize a well-known result of Hebisch and Weinert that states that a finite semidomain is either zerosumfree or a ring. Specifically, we show that the class of commutative semirings S such that S has nonzero characteristic and every zero-divisor of S is nilpotent can be partitioned into zerosumfree semirings and rings. In addition, we demonstrate that if S is a finite commutative semiring such that the set of zero-divisors of S forms a subtractive ideal of S, then either every zero-sum of S is nilpotent or S must be a ring. An example is given to establish the existence of semirings in this latter category with both nontrivial zero-sums and zero-divisors that are not nilpotent.

New Fictitious Play Procedure For Solving Blotto Games (Blotto 게임을 풀기위한 새로운 근사해법 절차)

  • Lee, Jea-Yeong;Lee, Moon-Gul
    • Journal of the military operations research society of Korea
    • /
    • v.31 no.1
    • /
    • pp.107-121
    • /
    • 2005
  • In this study, a new fictitious play (FP) procedure is presented to solve two-person zero-sum (TPZS) Blotto games. The FP solution procedure solves TPZS games by assuming that the two players take turns selecting optimal responses to the opponent's strategy observed so far. It is known that FP converges to an optimal solution, and it may be the only realistic approach to solve large games. The algorithm uses dynamic programming (DP) to solve FP subproblems. Efficiency is obtained by limiting the growth of the DP state space. Blotto games are frequently used to solve simple missile defense problems. While it may be unlikely that the models presented in this paper can be used directly to solve realistic offense and defense problems, it is hoped that they will provide insight into the basic structure of optimal and near-optimal solutions to these important, large games, and provide a foundation for solution of more realistic, and more complex, problem

Equilibrium Points of Bimatrix Games: A State-of-the-Art (쌍행열게임의 평형점)

  • Kim, Yeo-Geun
    • Journal of the military operations research society of Korea
    • /
    • v.8 no.2
    • /
    • pp.57-68
    • /
    • 1982
  • Bimatrix games are the two-person non-zero-sum non-cooperative games. These games were studied by Mills, Lemke, Howson, Millham, Winkels, and others. This paper is a systematic and synthetic survey relevant to bimatrix games. Among the many aspects of researches on bimatrix games, emphasis in this paper is placed on the relation of the equilibrium set to Nash subsets. Topics discussed are as follows: Properties of equilibrium point; The structure of equilibrium set; Relation of Nash subsets to equilibrium set; Algorithm for finding the equilibrium points; Concepts of solutions on bimatrix games.

  • PDF

A Method for Solving Vector-payoff Game (벡타이득게임의 해법)

  • 박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.6 no.2
    • /
    • pp.21-23
    • /
    • 1981
  • It is known that two-person zero-sum game with vector payoff can be reduced to a multiple objective linear programming. However, in this case, solutions for the game nay not be one, but many, In many cases in reality, one may need only one solution rather than all solutions. This paper develops a method to find a practical solution for the game by linear programming.

  • PDF

2人 섰다 게임

  • 권치명;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.7 no.2
    • /
    • pp.53-58
    • /
    • 1982
  • ‘섰다’ 게임은 흔히 애용되는 게임이다. 이 논문은 이 섰다 게임의 모형화를 시도한 것으로써 특히 2人섰다게임을 2인영합게임 (two-person zero-sum game)으로 모형화하여 최적해를 구해 보았다. 이 2人섰다 게임은 선과 또 한 사람사이의 섰다게임으로 판돈과 설 때 내는 돈의 액수에 따라 최적해가 달라지는 데 예로써 판돈보다 설 때 내는 돈이 3배일 때는 선은 7끗 이상일 때서는 것이 최적이고 상대방은 9끗 이상일 때서는 것이 최적이다. 이때 게임의 값은 -0.35이다.

  • PDF

Differential Game Approach to Competitive Advertising Model

  • Park, Sung-Joo;Lee, Keon-Chang
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.12 no.1
    • /
    • pp.95-105
    • /
    • 1986
  • This paper presents an adaptive algorithm to generate a near-optimal closed-loop solution for a non-zero sum differential game by periodically updating the solutions of the two-point boundary-value problem. Applications to competitive advertising problem show that the adaptive algorithm can be used as an efficient tool to solve the differential game problem in which one player may take advantage of the other's non-optimal play.

  • PDF