Hotelling’s location model with negative network externalities

We study a variation of Hotelling’s location model in which consumers choose between firms based on travel distances as well as the number of consumers visiting each firm. The model in which the network externality is the same for all firms was proposed by Kohlberg (Econ Lett 11:211–216, 1983), who claims that no equilibrium exists for more than two firms. We assume the network effects to be linear and, in contrast to the claim in Kohlberg (Econ Lett 11:211–216, 1983), derive a condition under which a subgame perfect Nash equilibrium exists for four and six firms. Moreover, we show that for more than two firms the equilibrium locations of the firms are different from the equilibrium locations in Hotelling’s location model. Our results suggest that a subgame perfect Nash equilibrium exists if and only if the number of firms is even. We also provide examples of subgame perfect equilibria in which the network externality is different for some of the firms.     

A non-cooperative interpretation of the kernel

The purpose of the paper is to propose a bargaining game to interpret the kernel non-cooperatively. Based on the idea of the Davis-Maschler reduced game, a bilateral bargaining procedure is provided in our game model. We show that the set of all subgame perfect equilibrium outcomes of our non-cooperative game coincides with the kernel for transferable utility games.     

产品多方面差异下双寡头定位定价模型

建立在同类产品存在多方面差异条件下双寡头企业两阶段动态定位定价博弈模型,在市场中存在不同类型消费者时,求出了使企业利润最大化的子博弈精炼纳什均衡,并深入分析了消费者对两家企业平均偏好效用差(ΔU)和企业的运输成本率(t)对企业定位定价策略的影响.     

考虑相互依赖性的信息系统安全投资及协调机制

考虑信息系统安全相互依赖情形下最优化信息系统连续时间安全投资水平是一个值得研究的问题。首先讨论了非合作博弈下信息系统安全投资的最优策略选择,在此基础上讨论了安全投资效率参数、黑客学习能力、传染风险对信息系统脆弱性及信息系统安全投资率的影响。其次,在推导出两企业在合作博弈情形下最优策略选择的基础上,对比两种情形下的博弈均衡结果,得出合作博弈下的投资水平高于非合作博弈下的投资水平。原因是两个企业的相互依赖关系隐含着企业投资的负外部性,从而导致企业投资不足。最后,构建一种双边支付激励机制消除企业投资不足问题,从而使企业达到合作博弈下的最优投资水平,提高两个企业的收益。     

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.     

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.     

Opportune moment strategies for a cost spanning tree game

Cost spanning tree problems concern the construction of a tree which provides a connection with the source for every node of the network. In this paper, we address cost sharing problems associated to these situations when the agents located at the nodes act in a non-cooperative way. A class of strategies is proposed which produce minimum cost spanning trees and, at the same time, are strong Nash equilibria for a non-cooperative game associated to the problem. They are also subgame perfect Nash equilibria.     

Nash bargaining solution under externalities

We define a Nash bargaining solution (NBS) of partition function games. Based on a partition function game, we define an extensive game, which is a propose–respond sequential bargaining game where the rejecter of a proposal exits from the game with some positive probability. We show that the NBS is supported as the expected payoff profile of any stationary subgame perfect equilibrium (SSPE) of the extensive game such that in any subgame, a coalition of all active players forms immediately. We provide a necessary and sufficient condition for such an SSPE to exist. Moreover, we consider extensions to the cases of nontransferable utilities, time discounting and multiple-coalition formation.     

寡头市场的一类动态博弈模型

首先讨论了寡头垄断市场中n批厂商分批(每批至少有两个以上的厂商)先后进入某行业各批厂商依次且每批同时选择其产量的动态博弈模型的子博弈精练解及其相关结论,探讨了此结论与有关问题的比较分析,并给出此问题的几种特殊情况,说明了此模型的广泛性和实用性.     

具有产品质量差异的扩展Hotelling模型

假定两家厂商生产的同种产品具有质量差异,及消费者对产品质量偏好服从[d,e]区间上的均匀分布情况,研究了二次运输成本Hotelling模型:两家厂商首先沿[0,1]线性城市同时选址,然后进行价格竞争.运用后退归纳法得到了子博弈精炼Nash均衡,此时厂商将选址于城市中心。     

考虑损失厌恶行为与谈判破裂的Rubinstein谈判博弈研究

本文考虑具有损失厌恶行为与破裂风险的Rubinstein谈判博弈。首先构建子博弈完美均衡,并证明子博弈完美均衡的存在性及唯一性。然后分析子博弈完美均衡的性质,结果表明:参与人受益于对手的损失厌恶行为,而因自身具有损失厌恶行为遭受损失;谈判破裂概率对均衡结果的影响取决于贴现因子与参与人的损失厌恶系数;当谈判破裂的概率趋于零时,极限均衡结果收敛于经典的Rubinstein谈判博弈结果。最后建立了与非对称Nash谈判解的关系,其中参与人的议价能力与自身的损失厌恶水平呈负相关性,与对手的损失厌恶水平呈正相关性;参与人的议价能力依赖于谈判破裂概率与出价时间间隔的比值。     

On implementation via demand commitment games

A simple version of the Demand Commitment Game is shown to implement the Shapley value as the unique subgame perfect equilibrium outcome for any n-person characteristic function game. This improves upon previous models devoted to this implementation problem in terms of one or more of the following: a) the range of characteristic function games addressed, b) the simplicity of the underlying noncooperative game (it is a finite horizon game where individuals make demands and form coalitions rather than make comprehensive allocation proposals and c) the general acceptability of the noncooperative equilibrium concept. A complete characterization of an equilibrium strategy generating the Shapley value outcomes is provided. Furthermore, for 3 player games, it is shown that the Demand Commitment Game can implement the core for games which need not be convex but have cores with nonempty interiors. Received March 1995/Final version February 1997     

A non-cooperative foundation for the continuous Raiffa solution

This paper provides a non-cooperative foundation for (asymmetric generalizations of) the continuous Raiffa solution. Specifically, we consider a continuous-time variation of the classic Ståhl–Rubinstein bargaining model, in which there is a finite deadline that ends the negotiations, and in which each player’s opportunity to make proposals is governed by a player-specific Poisson process, in that the rejecter of a proposal becomes proposer at the first next arrival of her process. Under the assumption that future payoffs are not discounted, it is shown that the expected payoffs players realize in subgame perfect equilibrium converge to the continuous Raiffa solution outcome as the deadline tends to infinity. The weights reflecting the asymmetries among the players correspond to the Poisson arrival rates of their respective proposal processes.     

On Pareto equilibria in vector-valued extensive form games

In this paper we investigate the existence of Pareto equilibria in vector-valued extensive form games. In particular we show that every vector-valued extensive form game with perfect information has at least one subgame perfect Pareto equilibrium in pure strategies. If one tries to prove this and develop a vector-valued backward induction procedure in analogy to the real-valued one, one sees that different effects may occur which thus have to be taken into account: First, suppose the deciding player at a nonterminal node makes a choice such that the equilibrium payoff vector of the subgame he would enter is undominated under the equilibrium payoff vectors of the other subgames he might enter. Then this choice need not to lead to a Pareto equilibrium. Second, suppose at a nonterminal node a chance move may arise. The combination of the Pareto equilibria of the subgames to give a strategy combination of the entire game need not be a Pareto equilibrium of the entire game.     

Strategic behavior of experienced subjects in a common pool resource game

This paper describes the results of an experiment applying the strategy method to analyze the behavior of subjects in an 8-player common pool resource (CPR) game. The CPR game consists of a constituent game played for 20 periods. The CPR game has a unique optimum and a unique subgame perfect equilibrium; the latter involves overinvestment in the appropriation from the CPR. Sixteen students, all experienced in game theory, were recruited to play the CPR game over the course of 6 weeks. In the first phase of the experiment, they played the CPR game on-line 3 times. In the second phase of the experiment, the tournament phase, they designed strategies which were then played against each other. At the aggregate level, subgame perfect equilibrium organizes the data fairly well. At the individual level, however, fewer than 5% of subjects play in accordance with the game equilibrium prediction. Received May 1994/Final version August 1996     

Decentralized job matching

This paper studies a multi-stage decentralized matching model where firms sequentially propose their (unique) positions to workers. At each stage workers sequentially decide which offer to accept (if any). A firm whose offer has been declined may make an offer to another worker in the next stage. The game stops when all firms either have been matched to a worker or have already made unsuccessful offers to any worker remaining in the market. We show that there is a unique subgame-perfect equilibrium outcome, the worker-optimal matching. Firms in this game have a weakly dominant strategy, which consists of making offers in the same order as given by their preferences. When workers play simultaneously any stable matching can be obtained as an equilibrium outcome, but an unstable matching can obtain in equilibrium.     

On finding curb sets in extensive games

We characterize strategy sets that are closed under rational behavior (curb) in extensive games of perfect information and finite horizon. It is shown that any such game possesses only one minimal curb set, which necessarily includes all its subgame perfect Nash equilibria. Applications of this result are twofold. First, it lessens computational burden while computing minimal curb sets. Second, it implies that the profile of subgame perfect equilibrium strategies is always stochastically stable in a certain class of games.I am grateful to J. Kamphorst, G. van der Laan and X. Tieman, who commented on the earlier versions of the paper. I also thank an anonymous referee and an associate editor for their helpful remarks. The usual disclaimer applies.     

The minimum cost shortest-path tree game

A minimum cost shortest-path tree is a tree that connects the source with every node of the network by a shortest path such that the sum of the cost (as a proxy for length) of all arcs is minimum. In this paper, we adapt the algorithm of Hansen and Zheng (Discrete Appl. Math. 65:275?C284, 1996) to the case of acyclic directed graphs to find a minimum cost shortest-path tree in order to be applied to the cost allocation problem associated with a cooperative minimum cost shortest-path tree game. In addition, we analyze a non-cooperative game based on the connection problem that arises in the above situation. We prove that the cost allocation given by an ??à la?? Bird rule provides a core solution in the former game and that the strategies that induce those payoffs in the latter game are Nash equilibrium.     

Forming coalitions and the Shapley NTU value

A simple protocol for coalition formation is presented. First, an order of the players is randomly chosen. Then, a coalition grows by sequentially incorporating new members in this order. The protocol is studied in the context of non-transferable utility (NTU) games in characteristic function form. If (weighted) utility transfers are feasible when everybody cooperates, then the expected subgame perfect equilibrium payoff allocation anticipated before any implemented game is the Shapley NTU value.     

Sequential Formation of Coalitions Through Bilateral Agreements in a Cournot Setting

We study a sequential protocol of endogenous coalition formation based on a process of bilateral agreements among the players. We apply the game to a Cournot environment with linear demand and constant average costs. We show that the final outcome of any subgame perfect equilibrium of the game is the grand coalition, provided the initial number of firms is high enough and they are sufficiently patient.This research was partially conducted while the first authors were visiting the Department of Economics of the Norwegien School of Economics and Business Administration (Bergen).