A note on network formation with decay

This paper studies an endogenous network formation with decay. We introduce a strategic form game based on a simple bilateral cost allocation rule. We show that a strong Nash equilibrium of this game always exists and necessarily achieves efficient networks.     

Are incentives against economic justice?

We consider the problem of fairly allocating a social endowment of indivisible goods and money when the domain of admissible preferences contains, but is not restricted to, quasi-linear preferences. We analyze the manipulability of the Generalized Money Rawlsian Fair (GMRF) solutions. (i) We show that the Nash and strong Nash equilibrium correspondences of the “preference revelation game form” associated with each GMRF solution coincide with the no-envy solution (in equilibrium, efficiency is preserved according to agents' true preferences). (ii) A corollary is that the GMRF solutions “naturally implement” the no-envy solution in Nash and strong Nash equilibria.     

ENDOGENOUS TIMING AND STRATEGIC CHOICE: THE COURNOT‐BERTRAND MODEL

Cournot establishes a Nash equilibrium to a duopoly game under output competition; Bertrand finds a different Nash equilibrium under price competition. Both treat the strategic choice variable (output versus price) and the timing of play as exogenous. We investigate Cournot‐Bertrand models where one firm competes in output and the other competes in price in both static and dynamic settings. We also develop a general model where both the timing of play and the strategic choice variables are endogenous. Consistent with the conduct of Honda and Scion, we show that Cournot‐Bertrand behaviour can be a Nash equilibrium outcome.     

Dynamic management of water transfer between two interconnected river basins

This paper analyzes the dynamic interaction between two regions with interconnected river basins. Precipitation is higher in one river-basin while water productivity is higher in the other. Water transfer increases productivity in the recipient basin, but may cause environmental damage in the donor basin. The recipient faces a trade-off between paying the price of the water transfer, or investing in alternative water supplies to achieve a higher usable water capacity. We analyze the design of this transfer using a dynamic modeling approach, which relies on non-cooperative game theory, and compare solutions with different information structures (Nash open-loop, Nash feedback, and Stackelberg) with the social optimum. We first assume that the equilibrium between supply and demand determines the optimal transfer price and amount. We show that, contrary to the static case, in a realistic dynamic setting in which the recipient uses a feedback information structure the social optimum will not emerge as the equilibrium solution. We then study different leadership situations in the water market and observe that the transfer amount decreases toward a long-run value lower than the transfer under perfect competition, which in turn lays below the social optimum. In consequence, the water in the donor's river-basin river converges to a better quality in the presence of market power. Finally, we numerically compare our results to the Tagus-Segura water transfer described in Ballestero (2004). Welfare gains are compared for the different scenarios. We show that in all dynamic settings, the long-run transfer amount is lower than in Ballestero's static model. Further, we show that the long-run price settles at a lower level than in Ballestero's model, but is still higher than the average cost-based price determined by the Spanish government.     

Feasible elimination procedures in social choice: An axiomatic characterization

Feasible elimination procedures (Peleg, 1978) play a central role in constructing social choice functions which have the following property: in the associated game form, for any preference profile there exists a strong Nash equilibrium resulting in the sincere outcome. In this paper we provide an axiomatic characterization of the social choice correspondences resulting from applying feasible elimination procedures. The axioms are anonymity, Maskin monotonicity, and independent blocking. We also show that these axioms are logically independent.     

Nash Equilibrium and Welfare Optimality

If A is a set of social alternatives, a social choice rule (SCR) assigns a subset of A to each potential profile of individuals' preferences over A , where the subset is interpreted as the set of "welfare optima". A game form (or "mechanism") implements the social choice rule if, for any potential profile of preferences, (i) any welfare optimum can arise as a Nash equilibrium of the game form (implying, in particular, that a Nash equilibrium exists) and, (ii) all Nash equilibria are welfare optimal. The main result of this paper establishes that any SCR that satisfies two properties—monotonicity and no veto power—can be implemented by a game form if there are three or more individuals. The proof is constructive.     

文化创意产品的版权博弈分析

以人的创造力和知识创新为核心要素的文化创意产业日益成为未来经济增长的动力源泉。在深入了解文化创意产业的内涵及特征的基础上，为促进这一新兴产业更快更好地发展，本文研究了文化创意产业主体之间为占有市场，选择对创意产品采取竞争或激励措施的博弈问题。本文的研究发现：纳什均衡中，文化创意产品的版权博弈双方为了自身收益最大化会独立进行价值投入；斯坦克尔伯格均衡中，版权受让商的价值投入与版权让与商的努力水平成正比，与价值投入成本成反比，双方在纳什均衡条件下投入较少，而各自的均衡期望收益在斯坦克尔伯格均衡条件下更高。     

On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm

This study analyzes a preference revelation game in the student-optimal deferred acceptance algorithm in a college admission problem. We assume that each college's true preferences are known publicly, and analyze the strategic behavior of students. We demonstrate the existence of a strictly strong Nash equilibrium in the preference revelation game through a simple algorithm that finds it. Specifically, (i) the equilibrium outcome from our algorithm is the same matching as in the efficiency-adjusted deferred acceptance algorithm and (ii) in a one-to-one matching market, it coincides with the student-optimal von Neumann–Morgenstern (vNM) stable matching. We also show that (i) when a strict core allocation in a housing market derived from a college admission market exists, it can be supported by a strictly strong Nash equilibrium, and (ii) there exists a strictly strong Nash equilibrium under the college-optimal deferred acceptance algorithm if and only if the student-optimal stable matching is Pareto-efficient for students.     

Profitability of corporate social responsibility in network industries

The present paper shows that, when firms compete in a non-cooperative way on the level of corporate social responsibility (CSR) in network industries, the conventional result of the prisoner’s dilemma structure of the game in standard industries—i.e. to have social concerns is the Nash equilibrium, but it is harmful for firms’ profits—vanishes and, for sufficiently intense network externalities, the equilibrium in which both firms have social concerns is more profitable than simple profit-seeking. Moreover, we show that—when firms cooperate in choosing the profit-maximising level of social concerns—a profit-maximising CSR level does exist, provided that network effects are sufficiently strong. Therefore, in network industries, firms may obtain higher profits engaging in—cooperatively as well as non-cooperatively—CSR activities, showing that firms’ social concerns may be motivated by the owners’ selfish behaviour. Finally, a counter-intuitive result as regards consumer’s surplus and social welfare is obtained: those are always higher under competitive than cooperative choice of CSR because the level of CSR activities is higher in the former case. However, given that firms gain their largest profits with the cooperative choice of CSR, a Pareto-superior outcome is not reached.     

How urbanization affect employment and social interactions

We develop a model where the unemployed workers in the city can find a job either directly or through weak or strong ties. We show that, in denser areas, individuals choose to interact with more people and meet more random encounters (weak ties) than in sparsely populated areas. We also demonstrate that, for a low urbanization level, there is a unique steady-state equilibrium where workers do not interact with weak ties, while, for a high level of urbanization, there is a unique steady-state equilibrium with full social interactions. We show that these equilibria are usually not socially efficient when the urban population has an intermediate size because there are too few social interactions compared to the social optimum. Finally, even when social interactions are optimal, we show that there is over-urbanization in equilibrium.     

Fictitious play property of the Nash demand game

We show that the Nash demand game has the fictitious play property. We also show that almost every fictitious play process and its associated belief path converge to a pure-strategy Nash equilibrium in the Nash demand game.     

Maskin's Theorem with limited veto power

We weaken the no-veto power condition of Maskin [Maskin, E.,1999. Nash equilibrium and welfare optimality. Rev. Econ. Stud. 66, 23–38] to limited veto power, and prove that any monotonic social choice rule is Nash implementable if it satisfies this weaker condition. The result is obtained by using the canonical Maskin mechanism without modification. An immediate corollary is that the weak core is Nash implementable in any coalitional game environment. An example is given to show that the strong core need not be implementable, even when it is monotonic.     

Voluntary Contributions to Multiple Public Projects

The problem of financing a set of discrete public goods (facilities, projects) by private contributions is studied. The corresponding cooperative game, the realization game , is shown to be convex. For the noncooperative setting we study a realization scheme that induces a strategic game. This contribution game is shown to be a generalized ordinal potential game ; a best–response in the contribution game implies a best response in a coordination game in which the payoff to all players is the utilitarian collective welfare function, i.e., the sum of the utility functions of the players. Strategy profiles maximizing utilitarian welfare are strong Nash equilibria of the contribution game. Each strong Nash equilibrium corresponds in a natural way with a core element of the realization game, and vice versa. Moreover, each strong Nash equilibrium is coalitional proof.     

Experimental investigation of stationary concepts in cyclic duopoly games

We experimentally test the predictive success of three stationary concepts in two cyclic duopoly games. The concepts are Nash equilibrium, impulse-balance equilibrium and payoff-sampling equilibrium. In the experiment 11 independent subject groups, consisting out of six participants interacting over 200 rounds, were gathered for each game. The comparison of the three concepts with mixed strategies shows that the order of performance from best to worst is as follows: payoff-sampling equilibrium, impulse-balance equilibrium, and Nash equilibrium. In addition the data exhibit a weak but significant tendency over time in the direction of coordination at a pure strategy equilibrium.     

Strong Equilibrium in Congestion Games

[6]introduced the class of congestion games and proved that they always possess a Nash equilibrium in pure strategies. Here we obtain conditions for the existence of a strong equilibrium in this class of games, as well as for the equivalence of Nash and strong equilibria. We also give conditions for uniqueness and for Pareto optimality of the Nash equilibrium. Except for a natural monotonicity assumption on the utilities, the conditions are expressed only in terms of the underlying congestion game form. It turns out that avoiding a certain type of bad configuration in the strategy spaces is essential to positive results.Journal of Economic LiteratureClassification Numbers: C71, C72, D62.     

Implementations of the Nash solution based on its Walrasian characterization

Summary. The present paper provides three different support results for the Nash bargaining solution of -person bargaining games. First, for any bargaining game there is defined a non-cooperative game in strategic form, whose unique Nash equilibrium induces a payoff vector that coincides with the Nash solution of the bargaining game. Next this game is modified in such a way that the unique Nash equilibrium that supports the Nash solution is even in dominant strategies. After that an -stage game in extensive form is presented whose unique subgame perfect equilibrium supports the Nash solution of the bargaining game. Finally, the support results are shown to induce implementation results in the sense of mechanism theory. Received: October 3, 1999; revised version: October 26, 1999     

The supercore for normal-form games

This paper analyzes the supercore of a system derived from a normal-form game. For the case of a finite game with pure strategies, we define a sequence of games and show that the supercore coincides with the set of Nash equilibria of the last game in that sequence. This result is illustrated with the characterization of the supercore for the n-person prisoner's dilemma. With regard to the mixed extension of a normal-form game, we show that the set of Nash equilibrium profiles coincides with the supercore for games with a finite number of Nash equilibria.     

Equilibrium play in matches: Binary Markov games

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of the match for the players, at each point, to play a Nash equilibrium of the point game; (b) it is a minimax behavior strategy in the match for a player to play minimax in each point game; and (c) when the point games all have unique Nash equilibria, the only Nash equilibrium of the binary Markov game consists of minimax play at each point. An application to tennis is provided.     

Kindness,confusion, or … ambiguity?

Other-regarding preferences or decision errors are the main explanations put forward to justify contributions exceeding the non-cooperative optimum in VCM games. An alternative rationale relies on ambiguity aversion. Ambiguity aversion increases the perceived marginal benefit of own contributions, which in equilibrium will exceed the Nash level. We present a series of experiments testing this hypothesis. To control for other-regarding preferences, we run a two-player game in which a human player plays with a virtual agent. Players are assigned either to a risky setting (known probabilities of opponent’s choices) or to an ambiguity setting (probabilities of opponent’s contribution are vague). Results show that ambiguity affects contributions. However, attitude to ambiguity appears to be affected by the location of the aggregate Nash optimum inside the decision space.     

On Nash implementation of Walrasian equilibria in a market for pure indivisibles without money

This paper deals with the Walrasian property of Nash and strong equilibria of a specific strategic market game which refers to a pure exchange economy involving purely indivisible commodities and no money. The game is of sealed-bid auction type and it is shown that any Nash equilibrium at which no agent is in status quo is a strong equilibrium and implements a Walrasian equilibrium. Moreover, it appears that two modifications of the game's rules ensure that any strong equilibrium outcome is Walrasian. These results are identical to those obtained by Svensson for markets involving purely indivisible goods and money.