The Shapley value for arbitrary families of coalitions

We address the problem of finding a suitable definition of a value similar to that of Shapley’s, when the games are defined on a subfamily of coalitions with no structure. We present two frameworks: one based on the familiar efficiency, linearity and null player axioms, and the other on linearity and the behavior on unanimity games. We give several properties and examples in each case, and give necessary and sufficient conditions on the family of coalitions for the approaches to coincide.     

An application of cooperative game among container terminals of one port

In this paper a two-stage game that involves three container terminals located in Karachi Port in Pakistan is discussed. In the first stage, the three terminals have to decide on whether to act as a singleton or to enter into a coalition with one or both of the other terminals. The decision at this stage should presumably be based on the predicted outcome for the second stage. The second stage is here modelled as a Bertrand game with one outside competitor, the coalition and the terminal in Karachi Port (if any) that has not joined the coalition. Furthermore, three partial and one grand coalition among the three terminals at Karachi Port are investigated. The concepts of “characteristic function” and “core” are used to analyse the stability of these coalitions and this revealed that one combination does not satisfy the superadditivity property of the characteristic function and can therefore be ruled out. The resulting payoffs (profits) of these coalitions are analysed on the basis of “core”. The best payoff for all players is in the case of a “grand coalition”. However, the real winner is the outsider (the terminal at the second port) which earns a better payoff without joining the coalition, and hence will play the role of the “orthogonal free-rider”.     

The lattice of embedded subsets

In cooperative game theory, games in partition function form are real-valued function on the set of the so-called embedded coalitions, that is, pairs (S,π) where S is a subset (coalition) of the set N of players, and π is a partition of N containing S. Despite the fact that many studies have been devoted to such games, surprisingly nobody clearly defined a structure (i.e., an order) on embedded coalitions, resulting in scattered and divergent works, lacking unification and proper analysis. The aim of the paper is to fill this gap, thus to study the structure of embedded coalitions (called here embedded subsets), and the properties of games in partition function form.     

On a variational inequality associated with a stopping game combined with a control

We study a non-linear elliptic variational inequality which corresponds to a zero-sum stopping game (Dynkin game) combined with a control. Our result is a generalization of the existing works by Bensoussan [ Stochastic Control by Functional Analysis Methods (North-Holland, Amsterdam), 1982], Bensoussan and Lions [ Applications des Inéquations Variationnelles en Contrôle Stochastique (Dunod, Paris), 1978] and Friedman [ Stochastic Differential Equations and Applications (Academic Press, New York), 1976] in the sense that a non-linear term appears in the variational inequality, or equivalently, that the underlying process for the corresponding stopping game is subject to a control. By using the dynamic programming principle and the method of penalization, we show the existence and uniqueness of a viscosity solution of the variational inequality and describe it as the value function of the corresponding combined-stochastic game problem.     

Quantum Prisoner’s Dilemma game on hypergraph networks

We study the possible advantages of adopting quantum strategies in multi-player evolutionary games. We base our study on the three-player Prisoner’s Dilemma (PD) game. In order to model the simultaneous interaction between three agents we use hypergraphs and hypergraph networks. In particular, we study two types of networks: a random network and a SF-like network. The obtained results show that in the case of a three-player game on a hypergraph network, quantum strategies are not necessarily stochastically stable strategies. In some cases, the defection strategy can be as good as a quantum one.     

Price competition and store competition: Store brands vs. national brand

This paper studies pricing strategies in a market channel composed of one national brand manufacturer and two retailers who, each, carry their own store brand and a national brand products. The model accounts for product competition between store brands and the national brand products, as well as for store competition between retailers.     

Pricing policies for substitutable products in a supply chain with Internet and traditional channels

This study considers pricing policies in a supply chain with one manufacturer, who sells a product to an independent retailer and directly to consumers through an Internet channel. In addition to the manufacturer’s product, the retailer sells a substitute product produced by another manufacturer. Given the wholesale prices of the two substitute products, the manufacturer decides the retail price of the Internet channel, and the retailer decides the retail prices of the two substitute products. Both the manufacturer and the retailer choose their own decision variables to maximize their respective profits. This work formulates the price competition, using the settings of Nash and Stackelberg games, and derives the corresponding existence and uniqueness conditions for equilibrium solutions. A sensitivity analysis of an equilibrium solution is then conducted for the model parameters, and the profits are compared for two game settings. The findings show that improving brand loyalty is profitable for both of the manufacturer and retailer, and that an increased service value may alleviate the threat of the Internet channel for the retailer and increase the manufacturer’s profit. The study also derives some conditions under which the manufacturer and the retailer mutually prefer the Stackelberg game. Based on these results, this study proposes an appropriate cooperation strategy for the manufacturer and retailer.     

Pricing and effort investment for a newsvendor-type product

We investigate a dominant retailer’s optimal joint strategy of pricing and timing of effort investment and analyze how it influences the decision of the manufacturer, the total supply chain profit, and the consumers’ payoff. We consider two pricing schemes of the retailer, namely, dollar markup and percentage markup, and two effort-investment sequences, namely, ex-ante and ex-post. A combination of four cases is analyzed. Our results show that: (1) under the same effort-decision sequence, a percentage-markup pricing scheme leads to higher expected profit for the retailer and the whole supply chain, but a lower expected profit for the manufacturer and a higher retail price for the consumers; (2) under the same markup-pricing strategy, the dominant retailer always prefers to postpone her effort decision until the manufacturer makes a commitment to wholesale price, since it can result in a Pareto-improvement for all the supply chain members. That is, the retailer’s and manufacturer’s expected profits are higher and the consumers pay a lower retail price; and (3) among the four joint strategies, the dominant retailer always prefers the joint strategy of percentage-markup plus ex-post effort decision. However, the dominated manufacturer always prefers the joint strategy of dollar-markup plus ex-post effort decision, which is also beneficial to the end consumers.     

Hybrid defensive resource allocations in the face of partially strategic attackers in a sequential defender–attacker game

Many models have been developed to study homeland security games between governments (defender) and terrorists (attacker, adversary, enemy), with the limiting assumption of the terrorists being rational or strategic. In this paper, we develop a novel hybrid model in which a centralized government allocates defensive resources among multiple potential targets to minimize total expected loss, in the face of a terrorist being either strategic or non-strategic. The attack probabilities of a strategic terrorist are endogenously determined in the model, while the attack probabilities of a non-strategic terrorist are exogenously provided. We study the robustness of defensive resource allocations by comparing the government’s total expected losses when: (a) the government knows the probability that the terrorist is strategic; (b) the government falsely believes that the terrorist is fully strategic, when the terrorist could be non-strategic; and (c) the government falsely believes that the terrorist is fully non-strategic, when the terrorist could be strategic. Besides providing six theorems to highlight the general results, we find that game models are generally preferred to non-game model even when the probability of a non-strategic terrorist is significantly greater than 50%. We conclude that defensive resource allocations based on game-theoretic models would not incur too much additional expected loss and thus more preferred, as compared to non-game-theoretic models.     

Cooperative advertising in a distribution channel with fairness concerns

Cooperative (co-op) advertising has been widely used in practice and employed as a strategy to improve the performance of a distribution channel. It is known from the existing models that co-op advertising could not achieve the channel coordination (i.e., maximize the total channel profit). In this paper, we consider a distribution channel consisting of a single manufacturer and a single retailer, and investigate the effect of the retailer’s fairness concerns. Applying the equilibrium analysis, we obtain the following results: (1) Channel coordination can be achieved if the retailer has fairness concerns and model parameters satisfy certain conditions. (2) Although both channel members become better off with co-op advertising if neither channel member has fairness concerns, we find situations where co-op advertising brings detrimental effects to the retailer if the retailer has fairness concerns. (3) The retailer’s fairness concerns may increase or decrease the equilibrium participation rate, the equilibrium advertising effort, and the equilibrium profit of the manufacturer and the whole channel. (4) We identify the conditions under which the effectiveness of co-op advertising can be improved or reduced by the retailer’s fairness concerns. As long as co-op advertising can bring extra profit to the manufacturer, the retailer’s fairness concerns could improve the effectiveness of the co-op advertising. (5) There exists a Pareto improvement for the profits of both the manufacturer and the retailer when a retailer without fairness concerns becomes fair-minded.