Advertising in a Differential Oligopoly Game

We illustrate a differential oligopoly game where firms compete à la Cournot in homogeneous goods in the market phase and invest in advertising activities aimed at increasing the consumers reservation price. Such investments produce external effects, characterizing the advertising activity as a public good. We derive the open-loop and closed-loop Nash equilibria, and show that the properties of the equilibria depend on the curvature of the market demand function. The comparative assessment of these equilibria shows that the firms advertising efforts are larger in the open-loop equilibrium than in the closed-loop equilibrium. We also show that a cartel involving all the firms, setting both output levels and advertising efforts, may produce a steady state where the social welfare level is higher than the social welfare levels associated with both open-loop and closed-loop noncooperative settings.     

On Nikaido-Isoda type theorems for discounted stochastic games

We present a class of countable state space stochastic games with discontinuous payoff functions satisfying some assumptions similar to the ones of Nikaido and Isoda for one-stage games. We prove that these games possess stationary equilibria. We show that after adding some concavity assumptions these equilibria are nonrandomized. Further, we present an example of input (or production) dynamic game satisfying the assumptions of our model. We give a closed-form solution for this game.     

Stochastic equilibrium programming for dynamic oligopolistic markets

This paper deals with the concept of stochastic equilibrium programming (SEP), which has recently been proposed for the modeling of imperfect competition on uncertain dynamic markets. We show that the equilibria computed via SEP correspond to an information structure, called S-adapted open-loop, which is not common in the dynamic game literature. We compare the single-player case with the many-player case using a simple two-stage dynamical system. An illustration of the use of the approach for the modeling of imperfect dynamic markets is also provided.This research was supported by FCAR, Québec, Canada, by CRSNG, Canada, by DG XII, European Commission, and by SPPS, Belgium.     

Pure strategy Nash equilibria and the probabilistic prospects of Stackelberg players

We consider the set of all m×n bimatrix games with ordinal payoffs. We show that on the subset E of such games possessing at least one pure strategy Nash equilibrium, both players prefer the role of leader to that of follower in the corresponding Stackelberg games. This preference is in the sense of first-degree stochastic dominance by leader payoffs of follower payoffs. It follows easily that on the complement of E, the follower’s role is preferred in the same sense. Thus we see a tendency for leadership preference to obtain in the presence of multiple pure strategy Nash equilibria in the underlying game.     

On participation games with complete information

We analyze a class of two-candidate voter participation games under complete information that encompasses as special cases certain public good provision games. We characterize the Nash equilibria of these games as stationary points of a non-linear programming problem, the objective function of which is a Morse function (onethat does not admit degenerate critical points) for almost all costs of participation. We use this fact to establish that, outside a closed set of measure zero of participation costs, all equilibria of these games are regular (an alternative to the result of De Sinopoli and Iannantuoni in Econ Theory 25(2):477–486, 2005). One consequence of regularity is that the equilibria of these games are robust to the introduction of (mild) incomplete information. Finally, we establish the existence of monotone Nash equilibria, such that players with higher participation cost abstain with (weakly) higher probability.      

Nash equilibria in optimal reinsurance bargaining

We introduce a strategic behavior in reinsurance bilateral transactions, where agents choose the risk preferences they will appear to have in the transaction. Within a wide class of risk measures, we identify agents’ strategic choices to a range of risk aversion coefficients. It is shown that at the strictly beneficial Nash equilibria, agents appear homogeneous with respect to their risk preferences. While the game does not cause any loss of total welfare gain, its allocation between agents is heavily affected by the agents’ strategic behavior. This allocation is reflected in the reinsurance premium, while the insurance indemnity remains the same in all strictly beneficial Nash equilibria. Furthermore, the effect of agents’ bargaining power vanishes through the game procedure and the agent who gets more welfare gain is the one who has an advantage in choosing the common risk aversion at the equilibrium.     

Truth-telling and Nash equilibria in minimum cost spanning tree models

In this paper we consider the minimum cost spanning tree model. We assume that a central planner aims at implementing a minimum cost spanning tree not knowing the true link costs. The central planner sets up a game where agents announce link costs, a tree is chosen and costs are allocated according to the rules of the game. We characterize ways of allocating costs such that true announcements constitute Nash equilibria both in case of full and incomplete information. In particular, we find that the Shapley rule based on the irreducible cost matrix is consistent with truthful announcements while a series of other well-known rules (such as the Bird-rule, Serial Equal Split, and the Proportional rule) are not.     

Perfect equilibria in stochastic games

We examine stochastic games with finite state and action spaces. For the -discounted case, as well as for the irreducible limiting average case, we show the existence of trembling-hand perfect equilibria and give characterizations of those equilibria. In the final section, we give an example which illustrates that the existence of stationary limiting average equilibria in a nonirreducible stochastic game does not imply the existence of a perfect limiting average equilibrium.Support was provided by the Netherlands Organization for Scientific Research NWO via the Netherlands Foundation for Mathematics SMC, Project 10-64-10.     

求解一类广义Nash均衡问题

Generalized Nash equilibrium problem (GNEP) is an important model that has many applications in practice. However, a GNEP usually has multiple or even infinitely many Nash equilibrium points and it is not easy to choose a favorable solution from those equilibria. This paper considers a class of GNEP with some kind of separability. We first extend the so-called normalized equilibrium concept to the stationarity sense and then, we propose an approach to solve the normalized stationary points by reformulating the GNEP as a single optimization problem. We further demonstrate the proposed approach on a GNEP model in similar product markets.     

A two-population game in observable double-ended queuing systems

In this study, the existing game theoretical framework is extended to strategic queuing in search of solutions for a two-population game in observable double-ended queuing systems with zero matching times. We show that multiple Nash equilibria and one unique subgame perfect Nash equilibrium exist in this game.     

The principal-agent problem with evolutionary learning

We extend agency theory to incorporate bounded rationality of both principals and agents. In this study we define a simple version of the principal-agent game and examine it using object-oriented computer simulation. Player learning is simulated with a genetic algorithm model. Our results show that players of incentive games in highly uncertain environments may take on defensive strategies. These defensive strategies lead to equilibria which are inferior to Nash equilibria. If agents are risk averse, the principal may not be able to provide enough monetary compensation to encourage them to take risks. But principals may be able to improve system performance by identifying good performers and facilitating information exchange among agents.The authors would like to thank the anonymous referees for their helpful suggestions.     

Equilibria of a stationary economy with recursive preferences

We consider an intertemporal stationary economy in discrete time, where agents have recursive preferences. Using dynamic programming, we show that equilibrium consumption trajectories from a capital stock are interior Pareto optima and are characterized by a strictly positive parameter in ^n–1, the set of agents' initial weights. We then exhibit prices that support the Pareto optima and use the Negishi method to characterize the parameters corresponding to equilibria. Finally, we prove the existence of equilibria and show that the number of regular equilibria is odd.     

On equilibrium threshold strategies when choosing between observable and unobservable queues

We consider threshold equilibrium strategies in a two-server memoryless queueing system where customers inspect one queue before deciding which queue to join. We show that such an equilibrium may not exist. A numerical study indicates that if threshold equilibria exist, the effective arrival rate to the unobserved queue is higher when the regime there is last-come first-served rather than first-come first-served.     

Continuity and Uniqueness of Equilibria for Linear Exchange Economies

The purpose of this paper is to study the continuity and uniqueness properties of equilibria for linear exchange economies. We characterize the sets of utility vectors and initial endowments for which the equilibrium price is unique and respectively the set for which the equilibrium allocation is unique. We show that the equilibrium allocation correspondence is continuous with respect to the initial endowments and we characterize the set of full measure where the equilibrium allocation correspondence with respect to the initial endowments and utility vectors is continuous.     

On existence of undominated pure strategy Nash equilibria in anonymous nonatomic games: a generalization

In this paper, we generalize the exitence result for pure strategy Nash equilibria in anonymous nonatomic games. By working directly on integrals of pure strategies, we also generalize, for the same class of games, the existence result for undominated pure strategy Nash equilibria even though, in general, the set of pure strategy Nash equilibria may fail to be weakly compact. Received August 2001     

A Discrete-Time Dynamic Game of Seasonal Water Allocation

We present a method for the derivation of feedback Nash equi- libria in discrete-time finite-horizon nonstationary dynamic games. A partic- ular motivation for such games stems from environmental economics, where problems of seasonal competition for water levels occur frequently among heterogeneous economic agents. These agents are coupled through a state variable, which is the water level. Actions are strategically chosen to max- imize the agents individual season-dependent utility functions. We observe that, although a feedback Nash equilibrium exists, it does not satisfy the (exogenous) environmental watchdog expectations. We devise an incentive scheme to help meeting those expectations and calculate a feedback Nash equilibrium for the new game that uses the scheme. This solution is more environmentally friendly than the previous one. The water allocation game solutions help us to draw some conclusions regarding the agents behavior and also about the existence of feedback Nash equilibria in dynamic games. The paper draws from Refs.1–2. Its earlier version was presented at the Victoria International Conference 2004, Victoria University of Wellington, Wellington, New Zealand, February 9–13, 2004. We thank the anonymous referee and Christophe Deissenberg for insightful comments, which have helped us to clarify its message. We also thank our colleagues Sophie Thoyer, Robert Lifran, Odile Pourtalier, and Vladimir Petkov for helpful discussions on the model and techniques used in this Paper. Gratitude is expressed to the Kyoto Institute for Economic Research, Kyoto University, for this author's support in the final stages of the paper preparation     

Congestion games with failures

We introduce a new class of games, congestion games with failures (CGFs), which allows for resource failures in congestion games. In a CGF, players share a common set of resources (service providers), where each service provider (SP) may fail with some known probability (that may be constant or depend on the congestion on the resource). For reliability reasons, a player may choose a subset of the SPs in order to try and perform his task. The cost of a player for utilizing any SP is a function of the total number of players using this SP. A main feature of this setting is that the cost for a player for successful completion of his task is the minimum of the costs of his successful attempts. We show that although CGFs do not, in general, admit a (generalized ordinal) potential function and the finite improvement property (and thus are not isomorphic to congestion games), they always possess a pure strategy Nash equilibrium. Moreover, every best reply dynamics converges to an equilibrium in any given CGF, and the SPs’ congestion experienced in different equilibria is (almost) unique. Furthermore, we provide an efficient procedure for computing a pure strategy equilibrium in CGFs and show that every best equilibrium (one minimizing the sum of the players’ disutilities) is semi-strong. Finally, for the subclass of symmetric CGFs we give a constructive characterization of best and worst equilibria.     

Competition among non-life insurers under solvency constraints: A game-theoretic approach

We formulate a noncooperative game to model competition for policyholders among non-life insurance companies, taking into account market premium, solvency level, market share and underwriting results. We study Nash equilibria and Stackelberg equilibria for the premium levels, and give numerical illustrations.     

An Epidemic Model with a Time Delay in Transmission

We study a mathematical model which was originally suggested by Greenhalgh and Das and takes into account the delay in the recruitment of infected persons. The stability of the equilibria are also discussed. In addition, we show that the introduction of a time delay in the transmission term can destabilize the system and periodic solutions can arise by Hopf bifurcation.     

Endogenous effort in communication networks under strategic complementarity

This article examines individual incentives to produce information on communication networks. In our setting, efforts are strategic complements along communication paths with convex decay. We analyze the relationship between efforts and centrality on a set of networks which are unambiguous in terms of ordinal centrality. We first show that in both dominant and dominated equilibria central agents exert more effort. Second, we explore the issue of social coordination induced by our game.