Repeated price competition with increasing marginal costs

We consider a repeated price setting game with firms facing increasing marginal costs and positive fixed costs. Besides setting prices, firms may decide to be not active. Since it is well known that there is no Nash-equilibrium in pure strategies in the stage game, we look for pure strategy equilibria in the repeated game and give a full characterization of all stationary symmetric equilibrium outcomes, supported by optimal penal codes (in pure strategies). [JEL-classification: D43, L13]     

Cyclic Markov equilibria in stochastic games

We examine a three-person stochastic game where the only existing equilibria consist of cyclic Markov strategies. Unlike in two-person games of a similar type, stationary ε-equilibria (ε > 0) do not exist for this game. Besides we characterize the set of feasible equilibrium rewards.     

Non-cooperative n-person game with a stopped set

A continuous time non-cooperative n-person Markov game with a stopped set is studied in this paper. We prove that, in the game process with or without discount factor, there exists an optimal stationary point of strategies, called the equilibrium point, and each player has his equilibrium stationary strategy, such that the total expected discounted or non-discounted gain are maximums.     

Nash fuzzy equilibrium: Theory and application to a spatial duopoly

Consider a non-cooperative n-persons game. Each gambler has a set of mixed strategies at his disposal. The payoffs are some physical or immaterial objects. The game is a fuzzy game because (1) gamblers have more or less precise preferences for the payoffs and (2) the outcoming of payoffs is uncertain. The uncertainty can be expressed either by a distribution of possibility or by a distribution of probability. The product set of a gambler's mixed strategies is convex and compact and the payoff functions are continuous. Then a closed and convex fuzzy point-to-set mapping is defined on the product set of strategies and, by using a Butnariu theorem, the existence of a fixed point for this fuzzy point-to-set mapping is proved. The issue allows us to generalize a famous Nash result: a n-persons non-cooperative fuzzy game with mixed strategies has at least one equilibrium point. In the second part of the paper an economic application is devoted to the statement of the equilibrium existence conditions in a spatial duopoly. The model is not only more general than the classical ones, but also more relevant because new results are obtained.     

A note on correlated equilibrium

The set of correlated equilibria for a bimatrix game is a closed, bounded, convex set containing the set of Nash equilibria. We show that every extreme point of a maximal Nash set is an extreme point of the above convex set. We also give an example to show that this result is not true in the payoff space, i.e. there are games where no Nash equilibrium payoff is an extreme point of the set of correlated equilibrium payoffs.     

On stationary equilibria of a single-controller stochastic game

We consider a two-person, general-sum, rational-data, undiscounted stochastic game in which one player (player II) controls the transition probabilities. We show that the set of stationary equilibrium points is the union of a finite number of sets such that, every element of each of these sets can be constructed from a finite number of extreme equilibrium strategies for player I and from a finite number of pseudo-extreme equilibrium strategies for player II. These extreme and pseudo-extreme strategies can themselves be constructed by finite (but inefficient) algorithms. Analogous results can also be established in the more straightforward case of discounted single-controller games.     

The use of public randomization in discounted repeated games

This paper presents an example where the set of subgame-perfect equilibrium payoffs of the infinitely repeated game without public randomization is not convex, no matter how large the discount factor is. Also, the set of pure-strategy equilibrium payoffs is not monotonic with respect to the discount factor in this example. These results are in sharp contrast to the fact that the equilibrium payoff set is convex and monotonic if public randomization is available.     

Equilibrium Correspondence of Linear Exchange Economies

According to Mertens (Ref. 1), the set of equilibrium prices in a linear exchange economy is a convex polyhedral cone (after adding {0}). We give a constructive proof of this fact. Then, we establish a lower-semicontinuity property of the equilibrium price correspondence. The set of equilibrium allocations is a closed, convex polyhedron. We give a characterization of this set.     

Noncooperative stochastic games under a n-stage local contraction assumption

We consider a class of noncooperative stochastic games with general state and action spaces and with a state dependent discount factor. The expected time duration between any two stages of the game is not bounded away from zero, so that the usual N-stage contraction assumption, uniform over all admissible strategies, does not hold. We propose milder sufficient regularity conditions, allowing strategies that give rise with probability one to any number of simultaneous stages. We give sufficient conditions for the existence of equilibrium and ∈-equilibrium stationary strategies in the sense of Nash. In the two-player zero-sum case, when an equilibrium strategy exists, the value of the game is the unique fixed point of a specific functional operator and can be computed by dynamic programming.     

连续对策之判断下的最优策略集

本文引进连续对策上的判断块、判断准确、判断下的最优策略集等概念，得到了如下几个主要结果：1.判断下的最优策略集是一个局部凸空间的非空有界闭凸集；2.两个判断下的最优策略集相等的充要条件是这两个判断位于同一判断块中；3.若局中人判断准确，则在一次性对策下不论他使用此判断下的那一个最优策略（不论是纯的还是混合的），都可无风险地取得最优赢得。     

Optimal Stopping with Information Constraint

We present a discrete n-person model of a dynamic strategic market game. We show that for some values of the discount factor the game possesses a stationary equilibrium where all the players make high bids. Within the class of all the high-bidding strategies we distinguish between two classes of more and less aggressive ones. We show that the set of discount factors for which these more aggressive strategies form equilibria shrinks as n goes to infinity. On the other hand, the analogous set for the less aggressive strategies grows to the whole interval (0,1) as n grows to infinity. Further we analyze the properties of the value function corresponding to these high-bidding equilibria. We also give some numerical examples contradicting some other properties that seem intuitive.     

Stochastic Games with Average Payoff Criterion

We study two-person stochastic games on a Polish state and compact action spaces and with average payoff criterion under a certain ergodicity condition. For the zero-sum game we establish the existence of a value and stationary optimal strategies for both players. For the nonzero-sum case the existence of Nash equilibrium in stationary strategies is established under certain separability conditions. Accepted 9 January 1997     

Internal correlation in repeated games

This paper characterizes the set of all the Nash equilibrium payoffs in two player repeated games where the signal that the players get after each stage is either trivial (does not reveal any information) or standard (the signal is the pair of actions played). It turns out that if the information is not always trivial then the set of all the Nash equilibrium payoffs coincides with the set of the correlated equilibrium payoffs. In particular, any correlated equilibrium payoff of the one shot game is also a Nash equilibrium payoff of the repeated game.For the proof we develop a scheme by which two players can generate any correlation device, using the signaling structure of the game. We present strategies with which the players internally correlate their actions without the need of an exogenous mediator.     

Forward-backward stochastic differential equation games with delay and noisy memory

Abstract

The goal of this paper is to study a stochastic game connected to a system of forward-backward stochastic differential equations (FBSDEs) involving delay and noisy memory. We derive sufficient and necessary maximum principles for a set of controls for the players to be a Nash equilibrium in the game. Furthermore, we study a corresponding FBSDE involving Malliavin derivatives. This kind of equation has not been studied before. The maximum principles give conditions for determining the Nash equilibrium of the game. We use this to derive a closed form Nash equilibrium for an economic model where the players maximize their consumption with respect to recursive utility.     

Loss of skills in coordination games

This paper deals with 2-player coordination games with vanishing actions, which are repeated games where all diagonal payoffs are strictly positive and all non-diagonal payoffs are zero with the following additional property: At any stage beyond r, if a player has not played a certain action for the last r stages, then he unlearns this action and it disappears from his action set. Such a game is called an r-restricted game. To evaluate the stream of payoffs we use the average reward. For r = 1 the game strategically reduces to a one-shot game and for r ≥ 3 in Schoenmakers (Int Game Theory Rev 4:119–126, 2002) it is shown that all payoffs in the convex hull of the diagonal payoffs are equilibrium rewards. In this paper for the case r = 2 we provide a characterization of the set of equilibrium rewards for 2 × 2 games of this type and a technique to find the equilibrium rewards in m × m games. We also discuss subgame perfection.     

On symmetric stochastic games of resource extraction with weakly continuous transitions

We study stochastic games of resource extraction, in which the players have identical preferences. The transition probability is either non-atomic or a convex combination of transition probabilities depending on the investment with coefficients also dependent on the investment. Our approach covers the unbounded utility case, which was not examined in this class of games beforehand. We prove the existence of a stationary Markov perfect equilibrium in a non-randomised class of strategies.     

Stationary,completely mixed and symmetric optimal and equilibrium strategies in stochastic games

In this paper, we address various types of two-person stochastic games—both zero-sum and nonzero-sum, discounted and undiscounted. In particular, we address different aspects of stochastic games, namely: (1) When is a two-person stochastic game completely mixed? (2) Can we identify classes of undiscounted zero-sum stochastic games that have stationary optimal strategies? (3) When does a two-person stochastic game possess symmetric optimal/equilibrium strategies? Firstly, we provide some necessary and some sufficient conditions under which certain classes of discounted and undiscounted stochastic games are completely mixed. In particular, we show that, if a discounted zero-sum switching control stochastic game with symmetric payoff matrices has a completely mixed stationary optimal strategy, then the stochastic game is completely mixed if and only if the matrix games restricted to states are all completely mixed. Secondly, we identify certain classes of undiscounted zero-sum stochastic games that have stationary optima under specific conditions for individual payoff matrices and transition probabilities. Thirdly, we provide sufficient conditions for discounted as well as certain classes of undiscounted stochastic games to have symmetric optimal/equilibrium strategies—namely, transitions are symmetric and the payoff matrices of one player are the transpose of those of the other. We also provide a sufficient condition for the stochastic game to have a symmetric pure strategy equilibrium. We also provide examples to show the sharpness of our results.     

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.     

A finite step algorithm via a bimatrix game to a single controller non-zero sum stochastic game

Given a non-zero sum discounted stochastic game with finitely many states and actions one can form a bimatrix game whose pure strategies are the pure stationary strategies of the players and whose penalty payoffs consist of the total discounted costs over all states at any pure stationary pair. It is shown that any Nash equilibrium point of this bimatrix game can be used to find a Nash equilibrium point of the stochastic game whenever the law of motion is controlled by one player. The theorem is extended to undiscounted stochastic games with irreducible transitions when the law of motion is controlled by one player. Examples are worked out to illustrate the algorithm proposed.The work of this author was supported in part by the NSF grants DMS-9024408 and DMS 8802260.     

Pure equilibria in a simple dynamic model of strategic market game

We present a discrete model of two-person constant-sum dynamic strategic market game. We show that for every value of discount factor the game with discounted rewards possesses a pure stationary strategy equilibrium. Optimal strategies have some useful properties, such as Lipschitz property and symmetry. We also show value of the game to be nondecreasing both in state and discount factor. Further, for some values of discount factor, exact form of optimal strategies is found. For β less than , there is an equilibrium such that players make large bids. For β close to 1, there is an equilibrium with small bids. Similar result is obtained for the long run average reward game.