Supply chain coordination mechanisms under asymmetric information with retailer cost disruptions

A two-level supply chain model involving one supplier and one retailer with linear demand is developed, and supply chain coordination mechanisms under asymmetric information （the retailer＇ s cost structure is asymmetric information） are proposed by employing game theory in two scenarios： coordination mechanisms under asymmetric information in a regular scenario （without disruption）; and coordination mechanisms under asymmetric information in an irregular scenario （ with retailer cost disruptions）. It is optimal for the supply chain to maintain the original production plan and to guarantee a steadily running system if variations of retailer costs are sufficiently low and do not exceed an upper bound. This shows that the original production plan has certain robustness under disruptions. Decisions must be re-made if a retailer＇ s cost change is greater and exceeds an upper bound. Impacts of retailer cost disruptions on the order quantity, the retail price, the wholesale price and each party＇ s as well as the system＇ s expected profits are investigated through numerical analyses.

Effects of cooperative mechanisms in mobile commerce value chain

In order to analyze the effects of different cooperative mechanisms between a mobile device manufacturer and a mobile network operator （ MNO ）, a Stackelberg structure is constructed. The manufacturer acts as a leader, while the MNO acts as a follower, i. e., a traditional retailer. Three cooperative mechanisms are considered： the manufacturer does not invest in developing the propriety function and software to support the infrastructure capacity of the MNO; the manufacturer invests in the development; the MNO offers a subsidy to encourage the manufacturer to invest in development. The results reveal that investing in the development can increase the profits of both the manufacturer and the MNO. Furthermore, if the MNO shares certain investment costs with the manufacturer, the MNO may charge higher prices of mobile connection services and mobile value-added services, and the profits of the two players may be enhanced.

MULTI-OBJECTIVE SHAPE DESIGN IN AERODYNAMICS USING GAME STRATEGY

Multi-objective optimization for the optimum shape design is introduced in aerodynamics using the Game theory. Based on the control theory, the employed optimizer and the negative feedback are used to implement the constraints. All the constraints are satisfied implicitly and automatically in the design. Furthermore,the above methodology is combined with a formulation derived from the Game theory to treat multi-point airfoil optimization. Airfoil shapes are optimized according to various aerodynamics criteria. In the symmetric Nash game, each “player” is responsible for one criterion, and the Nash equilibrium provides a solution to the multipoint optimization. Design results confirm the efficiency of the method.

MULTIOBJECTIVE OPTIMIZATION OF EIGHT-DOF VEHICLE SUSPENSION BASED ON GAME THEORY

A systematic and effective optimization is proposed for the design of a three-dimensional （3-D） vehicle suspension model with eight degrees of freedom （DOF）, including vertical seat motion, vehicle suspension, pitching and rolling motions, and vertical wheel motions using the evolutionary game theory. A new design of the passive suspension is aided by game theory to attain the best compromise between ride quality and suspension deflections. Extensive simulations are performed on three type road surface models A, B, C pavement grades based on the guidelines provided by ISO-2631 with the Matlab/Simulink environment. The preliminary results show that, when the passive suspension is optimized via the proposed approach, a substantial improvement in the vertical ride quality is obtained while keeping the suspension deflections within their allowable clearance when the vehicle moves at a constant velocity v=20 m/s, and the comfort performance of a suspension seat can be enhanced by 20%-30%.

Analysis on stability of strategic alliance: A game theory perspective

Strategic alliance has suffered much instabilities since its first implementation. Scholars have carried out many em- bedded, precise and comprehensive researches from both theory and empiricism. Here we try to find certain stable solutions by employing game theory, in an attempt to construct theoretical bases for strategic alliance, which people called “one of the most important organizational innovation in the end of the 20th century” (Shi, 2001), to exploit its advantages in the process of glob- alization. Finally, this article puts forward some advices for its success.

Pricing decision of green supply chain under the game competition of duopolistic retailers

In order to evaluate the impact of green production introduced by the manufacturer and study the competitive strategy between two retailers,four strategic models among diverse retailers,i.e.,Cournot,Stackelberg and two cases of collusion,are constructed.The optimal decision is obtained by the game theory and numerical analysis.The results indicate that the manufacturer's marginal profitability is no less than that of the two retailers.However,due to the manufacturer's green cost,the downstream profitability of the supply chain may exceed the upstream manufacturer's profitability.The retailers'Cournot behavior causes the manufacturer to acquire the highest profitability and set the highest green level.However,there is an opposite result in collusion.Two retailers will choose Cournot pricing when the consumer's green sensitivity is higher than a threshold.When consumers are more sensitive to the price difference of products,retailers prefer collusion,and then choose the Stackelberg behavior.Manufacturers'profitability will increase as competition among retailers intensifies.Proper competition allows two duopolistic retailers to acquire a higher profitability.

A Game Theoretic Approach for Energy-Efficient In-Network Caching in Content-Centric Networks

Recently, content-centric networking （CCN） has become a hot research topic for the diffusion of contents over the Internet. Most existing works on CCN focus on the improvement of network resource utilization. Consequently, the energy consumption aspect of CCN is largely ignored. In this paper, we propose a distributed energyefficient in-network caching scheme for CCN, where each content router only needs locally available information to make caching decisions considering both caching energy consumption and transport energy consumption. We formulate the in-network caching problem as a non-cooperative game. Through rigorous mathematical analysis, we prove that pure strategy Nash equilibria exist in the proposed scheme, and it always has a strategy profile that implements the socially optimal configuration, even if the touters are self-interested in nature. Simulation results are presented to show that the distributed solution is competitive to the centralized scheme, and has superior performance compared to other popular caching schemes in CCN. Besides, it exhibits a fast convergence speed when the capacity of content routers varies.

Game theoretic analysis for pricing-based incentive mechanism in non-dedicated cooperative relay networks

In non-dedicated cooperative relay networks, each node is autonomous and selfish in nature, and thus spontaneous cooperation among nodes is challenged. To stimulate the selfish node to participate in cooperation, a pricing-based cooperation engine using game theory was designed. Firstly, the feasible regions of the charge price and reimbursement price were deduced. Then, the non-cooperative and cooperative games were adopted to analyze the amount of bandwidth that initiating cooperation node(ICN) forwards data through participating cooperation node(PCN) and the amount of bandwidth that PCN helps ICN to relay data. Meanwhile, the Nash equilibrium solutions of cooperation bandwidth allocations(CBAs) were obtained through geometrical interpretation. Secondly, a pricing-based cooperation engine was proposed and a cooperative communication system model with cooperation engines was depicted. Finally, an algorithm based on game theory was proposed to realize the cooperation engine. The simulation results demonstrate that, compared with the system without pricing-based incentive, the proposed system can significantly improve the ICN's metric measured by bit-per-Joule and increase the PCN's revenue.

A Game-Theoretic Approach to Elastic Control in Software-Defined Networking

Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migration operation, but not why. This paper designs a decision-making mechanism based on zero-sum game theory to reelect a new controller as the master for migrated switches. It first chooses a switch for migration in the heavy controller which invites its neighbors as the game players to compete for the master role of this switch in the game-playing field(GPF) which is an occasional and loose domain for game-playing. Second, based on the concept of GPF, we design a decentralized strategy to play the game and determine which player as the final master. We implement it by extending the Open Flow protocol. Finally, numerical results demonstrate that our distributed strategy can approach elastic control plane with better performance.

The Optimal Nash Equilibrium Strategies Under Competition

This paper presented a game theoretic model to study the competition for a single investment oppertunity under uncertainty. It models the hazard rate of investment as a function of competitors' trigger level. Under uncertainty and different information structure, the option and game theory was applied to researching the optimal Nash equilibrium strategies of one or more firm. By means of Matlab software, the paper simulates a real estate developing project example and illustrates how parameter affects investment strategies. The paper's work will contribute to the present investment practice in China.

CRSG:A congestion control routing algorithm for security defense based on social psychology and game theory in DTN

The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.

How Group Heuristics Promotes Cooperative Behavior in Social Dilemma SituationmExploration of Group Heuristics Effects on the Basis of Computer Simulation

As it is impossible to assume complete rationality in a social dilemma situation, the assumption of bounded rationality is appropriate. Under the bounded rationality, it would be reasonable to assume that one behaves according to the heuristics principle. The group identity effect in a social dilemma situation might be very important in order to attain cooperation. The aim of this study was to clarify how to promote a cooperative behavior by avoiding a social dilemma situation. The group heuristics was taken into account, and it was explored how the group heuristics promotes a cooperative behavior in a social dilemma situation. As a result of a two-person game theory experiment, the group heuristics was found to play an important role in a social dilemma situation, and enhance a cooperative behavior. For the following three cases, the higher cooperation rate was attained at the latter half of the experiment： （a） mutual in-group condition, （b） one-way in-group condition, and （f） one-way unknown condition （in-group）. In conclusion, the consciousness of in-group membership might help to promote actively mutual cooperation.

ANALYSIS OF GROUP MULTIUSER DETECTION BASED ON COALITION GAME THEORY

Coalition game theory is introduced to investigate the performance,fairness and stability of decorrelating group multiuser detection receiver,not only from the perspective of individual nodes,but also various coalitions and the whole system as well. Firstly,to derive how the system scale with coalition size,a stochastic model with transferable payoffs (stochastic TU-model) is provided. Secondly,to find the most preferred coalition structures from the view point of individual nodes,a model with Non-Transferable payoffs (NTU-model) is presented. Theoretical analysis and simulation results suggest that stochasticaly the grand coalition is payoff maximizing for the system as a whole,while individual nodes with good-conditioned channels may prefer local "win-win coalitions".

Analyzing the birth of TBT by Gametheory

Technical Barriers to Trade （TBT） have become an important obstacle to the export of Chinese agricultural products. The paper analyzes the connotation and the development trend of TBT, then analyzes the birth of TBT through using Game theory and explains the motives of the countries setting up TBT. Finally, the paper proposes countermeasures from two aspects of government and enterprises in China.

Game Theory Based False Negative Probability of Embedded Watermark Under Unintentional and Steganalysis Attacks

Steganalysis attack is to statistically estimate the embedded watermark in the watermarked multimedia,and the estimated watermark may be destroyed by the attacker.The existing methods of false negative probability,however,do not consider the influence of steganalysis attack.This paper proposed the game theory based false negative probability to estimate the impacts of steganalysis attack,as well as unintentional attack.Specifically,game theory was used to model the collision between the embedment and steganalysis attack,and derive the optimal building embedding/attacking strategy.Such optimal playing strategies devote to calculating the attacker destructed watermark,used for calculation of the game theory based false negative probability.The experimental results show that watermark detection reliability measured using our proposed method,in comparison,can better reflect the real scenario in which the embedded watermark undergoes unintentional attack and the attacker using steganalysis attack.This paper provides a foundation for investigating countermeasures of digital watermarking community against steganalysis attack.

Application of Game Theory in Social Science

Game theory is a tool for making decision for all scientists which it can predict the future. So many times, not only in professional life but in private life game theory can help people to make best decision. What make this article different with other game theory article is that it has written for arts science which they are not so much fluent in maths. The object of this article is to demonstrate the possibilities of game theory as an instrument for study of social science. The approach used to describe elementary games theoretic models as an integral part of social science with a collection of example to understand subject better. This paper addresses to theoreticians and practitioners of social science not particularly versed in game theory, rather than to those who are fluent in its mathematical language and intricacies.

A game-theory approach against Byzantine attack in cooperative spectrum sensing

In order to solve the Byzantine attack problem in cooperative spectrum sensing,a non-cooperative game-theory approach is proposed to realize an effective Byzantine defense.First,under the framework of the proposed non-cooperative game theory,the pure Byzantine attack strategy and defense strategy in cooperative spectrum sensing are analyzed from the perspective of the Byzantine attacker and network administrator.The cost and benefit of the pure strategy on both sides are defined. Secondly,the mixed attack and defense strategy are also derived. The closed form Nash equilibrium is obtained by the Lemke-Howson algorithm. Furthermore,the impact of the benefit ratio and penalty rate on the dynamic process of the noncooperative game is analyzed. Numerical simulation results show that the proposed game-theory approach can effectively defend against the Byzantine attack and save the defensive cost.

Influence of Constraint in Parameter Space on Quantum Games

We study the influence of the constraint in the parameter space on quantum games.Decomposing SU(2)operator into product of three rotation operators and controlling one kind of them,we impose a constraint on the parameter space of the players' operator.We find that the constraint can provide a tuner to make the bilateral payoffs equal,so that the mismatch of the players' action at multi-equilibrium could be avoided.We also find that the game exhibits an intriguing structure as a function of the parameter of the controlled operators,which is useful for making game models.

Non-Cooperative Differential Game Based Load Balancing Algorithm in Radio-Over-Fibre System

Load balancing plays a critical role in a cellular network. As one kind of cellular network, Radio-over-Fibre （RoF） system can provide ubiquitous high data-rate transmissions, which has attracted many attentions, but it also suffer load unbalancing problem. In order to improve the system performance, in this paper, we propose a novel loading balance scheme in RoF system based on differential game theory. The scheme formulates the load allocated to each RAP （Radio Access Point） as a Nasb Equilibrium, using non-cooperative differential game to obtain the optical load allocation of each RAP. The simulations performed show that the non-cooperative differential game algorithm is applicable and the optimal load solution can be achieved.