A private contributions game for joint replenishment

We study a non-cooperative game for joint replenishment by n firms that operate under an EOQ-like setting. Each firm decides whether to replenish independently or to participate in joint replenishment, and how much to contribute to joint ordering costs in case of participation. Joint replenishment cycle time is set by an intermediary as the lowest cycle time that can be financed with the private contributions of participating firms. We characterize the behavior and outcomes under undominated Nash equilibria.     

Dynamic pricing with uncertain production cost: An alternating-move approach

This article studies a two-firm dynamic pricing model with random production costs. The firms produce the same perishable products over an infinite time horizon when production (or operation) costs are random. In each period, each firm determines its price and production levels based on its current production cost and its opponent’s previous price level. We use an alternating-move game to model this problem and show that there exists a unique subgame perfect Nash equilibrium in production and pricing decisions. We provide a closed-form solution for the firm’s pricing policy. Finally, we study the game in the case of incomplete information, when both or one of the firms do not have access to the current prices charged by their opponents.     

Optimal production in a competitive market under yield uncertainty

Motivated by the U.S. influenza vaccine market, we study the impact of random yield and production capacity on the number of firms, total supply, consumer surplus and social welfare in a market with identical suppliers. We formulate a two-stage game with endogenous entry, where each entering firm aims to maximize its profit under yield uncertainty subject to a production capacity constraint. We show that if firms produce full capacity in the equilibrium, then there are fewer firms in the equilibrium compared to the social optimum even for small levels of yield uncertainty. Furthermore, we prove that if firms do not produce full capacity in the equilibrium, they will not produce full capacity in the social optimum.     

Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets

Consider the N-person non-cooperative game in which each player’s cost function and the opponents’ strategies are uncertain. For such an incomplete information game, the new solution concept called a robust Nash equilibrium has attracted much attention over the past several years. The robust Nash equilibrium results from each player’s decision-making based on the robust optimization policy. In this paper, we focus on the robust Nash equilibrium problem in which each player’s cost function is quadratic, and the uncertainty sets for the opponents’ strategies and the cost matrices are represented by means of Euclidean and Frobenius norms, respectively. Then, we show that the robust Nash equilibrium problem can be reformulated as a semidefinite complementarity problem (SDCP), by utilizing the semidefinite programming (SDP) reformulation technique in robust optimization. We also give some numerical example to illustrate the behavior of robust Nash equilibria.     

Dynamic consistency in incomplete information games under ambiguity

We develop a general framework of incomplete information games under ambiguity which extends the traditional framework of Bayesian games to the context of Ellsberg-type ambiguity. We then propose new solution concepts called ex ante and interim Γ-maximin equilibrium for solving such games. We show that, unlike the standard notion of Bayesian Nash equilibrium, these concepts may lead to rather different recommendations for the same game under ambiguity. This phenomenon is often referred to as dynamic inconsistency. Moreover, we characterize the sufficient condition under which dynamic consistency is assured in this generalized framework.     

Quantifying the value of buyer–vendor coordination: Analytical and numerical results under different replenishment cost structures

Despite a growing interest in channel coordination, no detailed analytical or numerical results measuring its impact on system performance have been reported in the literature. Hence, this paper aims to develop analytical and numerical results documenting the system-wide cost improvement rates that are due to coordination. To this end, we revisit the classical buyer–vendor coordination problem introduced by Goyal [S.K. Goyal, An integrated inventory model for a single-supplier single-customer problem. International Journal of Production Research 15 (1976) 107–111] and extended by Toptal et al. [A. Toptal, S. Çetinkaya, C.-Y. Lee, The buyer–vendor coordination problem: modeling inbound and outbound cargo capacity and costs, IIE Transactions on Logistics and Scheduling 35 (2003) 987–1002] to consider generalized replenishment costs under centralized decision making. We analyze (i) how the counterpart centralized and decentralized solutions differ from each other, (ii) under what circumstances their implications are similar, and (iii) the effect of generalized replenishment costs on the system-wide cost improvement rates that are due to coordination. First, considering Goyal’s basic setting, we show that the improvement rate depends on cost parameters. We characterize this dependency analytically, develop analytical bounds on the improvement rate, and identify the problem instances in which considerable savings can be achieved through coordination. Next, we analyze Toptal et al.’s [A. Toptal, S. Çetinkaya, C.-Y. Lee, The buyer–vendor coordination problem: modeling inbound and outbound cargo capacity and costs, IIE Transactions on Logistics and Scheduling 35 (2003) 987–1002] extended setting that considers generalized replenishment costs representing inbound and outbound transportation considerations, and we present detailed numerical results quantifying the value of coordination. We report significant improvement rates with and without explicit transportation considerations, and we present numerical evidence which suggests that larger rates are more likely in the former case.     

A game-theoretic analysis of information security investment for multiple firms in a network

The application of Internet of Things promotes the cooperation among firms, and it also introduces some information security issues. Due to the vulnerability of the communication network, firms need to invest in information security technologies to protect their confidential information. In this paper, considering the multiple-step propagation of a security breach in a fully connected network, an information security investment game among n firms is investigated. We make meticulous theoretic and experimental analyses on both the Nash equilibrium solution and the optimal solution. The results show that a larger network size (n) or a larger one-step propagation probability (q) has a negative effect on the Nash equilibrium investment. The optimal investment does not necessarily increase in n or q, and its variation trend depends on the concrete conditions. A compensation mechanism is proposed to encourage firms to coordinate their strategies and invest a higher amount equal to the optimal investment when they make decisions individually. At last, our model is extended by considering another direct breach probability function and another network structure, respectively. We find that a higher connection density of the network will result in a greater expected cost for each firm.     

Systemic Risk and Interbank Lending

We propose a simple model of the banking system incorporating a game feature, where the evolution of monetary reserve is modeled as a system of coupled Feller diffusions. The optimization reflects the desire of each bank to borrow from or lend to a central bank through manipulating its lending preference and the intention of each bank to deposit in the central bank in order to control the reserve and the corresponding volatility for cost minimization. The Markov Nash equilibrium for finite many players generated by minimizing the linear quadratic cost subject to Cox–Ingersoll–Ross type processes creates liquidity and deposit rate. The adding liquidity leads to a flocking effect implying stability or systemic risk depending on the level of the growth rate, but the deposit rate diminishes the growth of the total monetary reserve causing a large number of bank defaults. The central bank acts as a central deposit corporation. In addition, the corresponding mean field game in the case of the number of banks N large and the infinite time horizon stochastic game with the discount factor are also discussed.     

Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium

We consider an n-player finite strategic game. The payoff vector of each player is a random vector whose distribution is not completely known. We assume that the distribution of a random payoff vector of each player belongs to a distributional uncertainty set. We define a distributionally robust chance-constrained game using worst-case chance constraint. We consider two types of distributional uncertainty sets. We show the existence of a mixed strategy Nash equilibrium of a distributionally robust chance-constrained game corresponding to both types of distributional uncertainty sets. For each case, we show a one-to-one correspondence between a Nash equilibrium of a game and a global maximum of a certain mathematical program.     

Bidding and sequential coalition formation with externalities

We study coalition formation games with externalities where each agent’s payoff depends on the entire partition. As in Bloch (Games Econ Behav 14:90–123, 1996) and Ray and Vohra (Games Econ Behav 26:268–336, 1999), we assume that coalitions form sequentially and agreements are irreversible. Instead of a fixed order protocol, we use a “bidding mechanism” (see Pérez-Castrillo and Wettstein in Am Econ Rev 92(5):1577–1587, 2002) to determine proposals and transfers among the agents. We show that such a mechanism facilitates the attainment of efficiency; in particular, our game admits a Markov perfect equilibrium with the property of full dynamic efficiency. In addition, the aggregate equilibrium payoffs of our game exhibit monotonicity in time. Nevertheless, inefficient equilibria can also emerge.     

Game Options Analysis of the Information Role of Call Policies in Convertible Bonds

Abstract

In debt financing, existence of information asymmetry on the firm quality between the firm management and bond investors may lead to significant adverse selection costs. We develop the two-stage sequential dynamic two-person game option models to analyse the market signalling role of the callable feature in convertible bonds. We show that firms with positive private information on earning potential may signal their type to investors via the callable feature in a convertible bond. We present the variational inequalities formulation with respect to various equilibrium strategies in the two-person game option models via characterization of the optimal stopping rules adopted by the bond issuer and bondholders. The bondholders’ belief system on the firm quality may be revealed with the passage of time when the issuer follows his optimal strategy of declaring call or bankruptcy. Under separating equilibrium, the quality status of the firm is revealed so the information asymmetry game becomes a new game under complete information. To analyse pooling equilibrium, the corresponding incentive compatibility constraint is derived. We manage to deduce the sufficient conditions for the existence of signalling equilibrium of our game option model under information asymmetry. We analyse how the callable feature may lower the adverse selection costs in convertible bond financing. We show how a low-quality firm may benefit from information asymmetry and vice versa, underpricing of the value of debt issued by a high-quality firm.     

Mixed complementarity problems for robust optimization equilibrium in bimatrix game

In this paper, we investigate the bimatrix game using the robust optimization approach, in which each player may neither exactly estimate his opponent’s strategies nor evaluate his own cost matrix accurately while he may estimate a bounded uncertain set. We obtain computationally tractable robust formulations which turn to be linear programming problems and then solving a robust optimization equilibrium can be converted to solving a mixed complementarity problem under the l ₁ ∩ l _∞-norm. Some numerical results are presented to illustrate the behavior of the robust optimization equilibrium.     

Distributed consensus in noncooperative inventory games

This paper deals with repeated nonsymmetric congestion games in which the players cannot observe their payoffs at each stage. Examples of applications come from sharing facilities by multiple users. We show that these games present a unique Pareto optimal Nash equilibrium that dominates all other Nash equilibria and consequently it is also the social optimum among all equilibria, as it minimizes the sum of all the players’ costs. We assume that the players adopt a best response strategy. At each stage, they construct their belief concerning others probable behavior, and then, simultaneously make a decision by optimizing their payoff based on their beliefs. Within this context, we provide a consensus protocol that allows the convergence of the players’ strategies to the Pareto optimal Nash equilibrium. The protocol allows each player to construct its belief by exchanging only some aggregate but sufficient information with a restricted number of neighbor players. Such a networked information structure has the advantages of being scalable to systems with a large number of players and of reducing each player’s data exposure to the competitors.     

An optimal replenishment policy for deteriorating items with effective investment in preservation technology

In this paper, considering the amount invested in preservation technology and the replenishment schedule as decision variables, we formulate an inventory model with a time-varying rate of deterioration and partial backlogging. The objective is to find the optimal replenishment and preservation technology investment strategies while maximizing the total profit per unit time. For any given preservation technology cost, we first prove that the optimal replenishment schedule not only exists but is unique. Next, under given replenishment schedule, we show that the total profit per unit time is a concave function of preservation technology cost. We then provide a simple algorithm to figure out the optimal preservation technology cost and replenishment schedule for the proposed model. We use numerical examples to illustrate the model.     

Repeated newsvendor game with transshipments under dual allocations

We study a repeated newsvendor game with transshipments. In every period n retailers face a stochastic demand for an identical product and independently place their inventory orders before demand realization. After observing the actual demand, each retailer decides how much of her leftover inventory or unsatisfied demand she wants to share with the other retailers. Residual inventories are then transshipped in order to meet residual demands, and dual allocations are used to distribute residual profit. Unsold inventories are salvaged at the end of the period. While in a single-shot game retailers in an equilibrium withhold their residuals, we show that it is a subgame-perfect Nash equilibrium for the retailers to share all of the residuals when the discount factor is large enough and the game is repeated infinitely many times. We also study asymptotic behavior of the retailers’ order quantities and discount factors when n is large. Finally, we provide conditions under which a system-optimal solution can be achieved in a game with n retailers, and develop a contract for achieving a system-optimal outcome when these conditions are not satisfied.     

On the core of information graph games

This paper considers a subclass of minimum cost spanning tree games, called information graph games. It is proved that the core of these games can be described by a set of at most 2n — 1 linear constraints, wheren is the number of players. Furthermore, it is proved that each information graph game has an associated concave information graph game, which has the same core as the original game. Consequently, the set of extreme core allocations of an information graph game is characterized as the set of marginal allocation vectors of its associated concave game. Finally, it is proved that all extreme core allocations of an information graph game are marginal allocation vectors of the game itself, though not all marginal allocation vectors need to be core allocations.     

Choosing fair lotteries to defeat the competition

We study the following game: each agent i chooses a lottery over nonnegative numbers whose expectation is equal to his budget b _i . The agent with the highest realized outcome wins (and agents only care about winning). This game is motivated by various real-world settings where agents each choose a gamble and the primary goal is to come out ahead. Such settings include patent races, stock market competitions, and R&D tournaments. We show that there is a unique symmetric equilibrium when budgets are equal. We proceed to study and solve extensions, including settings where agents choose their budgets (at a cost) and where budgets are private information.     

Dominance solvable games and trees

We study social choice functions represented by Moulin's dominance solvable games. We first show that dominance solvability of games is independent of the order in which dominated strategies are deleted. This implies that the perfect equilibrium of a game with perfect information generally coincides with its solution according to dominance solvability. Then we show that a large class of d-solvable games yields the same social choice functions as those represented by games of perfect information. We show that for three alternatives and all n relatively prime to 6 there exists a method of social choice fractional elimination, which can be represented by a kingmaker tree. This covers some cases not previously covered by Moulin. We also find numerous examples.     

Who wants to break the hockey-stick sales pattern in the supply chain?

The hockey-stick pattern faced by suppliers consists of sales spikes at the end of each period. One of its causes is the information asymmetry that favors the retailer, who has better knowledge about the stochastic consumer demand. Because of delayed purchases, the supplier is induced to offer promotions, allowing the retailer to forward-buy at low prices. We model this situation as an infinitely repeated game, where each stage-game is subject to imperfect information. Drawing from the Nash equilibrium, we express sales and inventories in terms of demand, cost and the strategies players may adopt, and derive the conditions for a cooperative equilibrium.     

Analysis of a dual-sourcing service provision game with symmetric and asymmetric vendors

This paper models a service provision game between two vendors under symmetric and asymmetric cost structures, who compete in first-period service quality levels with each other, with the aim of winning the larger share of the buyer’s fixed reward in the second period. This game differs from the previous studies in that the buyer maintains dual sourcing over two periods and thus has different characteristics. We show that this service provision game has distinct mixed-strategy equilibria with the vendors under symmetric and asymmetric cost structures. We find that the larger the winner’s share in the second period, the higher the vendors’ first-period service quality levels. However, increasing the winner’s share in the second period does not necessarily benefit the vendor with the lower marginal cost, but surely hurts the equilibrium profit of the vendor with the higher marginal cost.