Juche in international trade

We show that in trade between two parties, one of whom has much greater endowment that the other, calculated by the Nash bargaining solution, tends to exploit the poorer party, as compared with the competitive equilibrium. This can be interpreted as saying that trade between a developed country and a developing nation, each acting on the basis of self-interest, will result in exploitation of the developing nation. This illustrates one aspect of the idea of Juche. We also show that if trade in two goods among two parties is extended to a third, one of the two parties will be worse off as a result under natural hypotheses. This can be interpreted as explaining why trade between a developing country and a developed country might make some groups in the developing country rich but other groups poor, a second aspect of Juche.     

On the incentive properties of multi-item auctions

In a market of indivisible objects where a buyer consumes at most one object, the buyer-optimal auction is a multi-item generalization of Vickrey's second-price auction. If the optimal auction is formulated as a strategic game, it is well-known that it satisfies good incentive properties, i.e., the honest strategy profile is a Nash equilibrium, a unique perfect equilibrium and a dominant strategy equilibrium. For each of the three incentive properties, it is shown that the optimal auction is aunique auction satisfying the property. The uniqueness results are derived in a general setting with budget constraints and non-linear utilities.I would like to thank three anonymous referees for detailed comments and constructive suggestions. I would also like to thank Edward J. Green and John G. Riley for their valuable comments and advice on earlier drafts of this paper. I am solely responsible for any errors.     

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.     

不完备偏好扩展式博弈的序贯均衡

将Kreps和Wilson提出的序贯均衡解概念推广到了存在不完备偏好的情形.首先给出了一个修正的颤抖手完美均衡的概念,然后应用它去证明不完备偏好扩展式博弈序贯均衡的存在性.     

双寡头动态定位定价博弈分析

本分析双寡头两阶段动态定位定价策略，首先两个企业同时选择地址，然后进行价格竞争。市场上有两种类型的消费，对企业提供的产品有不同的偏好，每个企业预测它对地址的选择会影响它的需求和竞争密度，给出了使企业利润最大的子博弈精练Nash均衡。     

野生中药材供给与稽查的不完全信息动态博弈分析

针对中药材供给中的信息不对称性,建立了三个中药材供给方与政府稽查部门之间的三个不完全信息动态博弈模型,得到了相应的子博弈精炼贝叶斯均衡解的五个结论.这五个结论合理刻画了中药材供给方与政府稽查部门的博弈行为并揭示了非法采挖野生中药材现象难以杜绝的原因.结果表明,政府对稽查行为的条件激励措施并不能有效杜绝非法采挖野生中药材现象,只有政府对所有的稽查行为实施普遍的强激励机制才可从根本上消除非法采挖野生中药材的现象.     

防范道德风险的博弈分析和契约设计

运用不完全信息动态博弈的理论，建立了一个防范道德风险的博弈模型．给出了该博弈的精炼贝叶斯纳什均衡．在此基础上给出了基于最优博弈策略的契约的具体形式。而这种基于博弈论的契约可以克服有成本的状态验证模型(CSV)及经典激励理论中承诺的可信性问题。     

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.     

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

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

非对称信息证券交易的跨期动态博弈均衡解析

揭示了不对称信息条件下证券市场均衡的基本特征.Grossman和Stiglitz模型依据不知情交易者的弱理性,解析了证券交易的静态均衡状态.O'Hara模型增强了不知情交易者的理性,强调了市场均衡时的风险定价,但其命题的成立条件是相互矛盾的.认为不知情交易者信息收集和处理能力的提高会使决策更为理性,证券市场的均衡本质上是交易者的动态博弈均衡.依此思路,运用不完美信息的跨期动态博弈模型解析了非对称信息条件下证券交易者的精炼贝叶斯纳什均衡.结论显示出,市场失效的主要原因是交易者之间的信息分析能力不平衡,而不是信息不对称;市场流动性的决定因素不是信息不对称风险而是知情交易者与不知情交易者所研判的无风险收益率的差别.     

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

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

A model of a 2-player stopping game with priority and asynchronous observation

Various models of 2-player stopping games have been considered which assume that players simultaneously observe a sequence of objects. Nash equilibria for such games can be found by first solving the optimal stopping problems arising when one player remains and then defining by recursion the normal form of the game played at each stage when both players are still searching (a 2 × 2 matrix game). The model considered here assumes that Player 1 always observes an object before Player 2. If Player 1 accepts the object, then Player 2 does not see that object. If Player 1 rejects an object, then Player 2 observes it and may choose to accept or reject it. It is shown that such a game can be solved using recursion by solving appropriately defined subgames, which are played at each moment when both players are still searching. In these subgames Player 1 chooses a threshold, such that an object is accepted iff its value is above this threshold. The strategy of Player 2 in this subgame is a stopping rule to be used when Player 1 accepts this object, together with a threshold to be used when Player 1 rejects the object. Whenever the payoff of Player 1 does not depend on the value of the object taken by Player 2, such a game can be treated as two optimisation problems. Two examples are given to illustrate these approaches.     

中国东西部经济合作进化博弈分析

本文从进化博弈理论上探讨东西部地区实现互利双赢合作的必然性与理论基础,得出结论:东西部经济合作不但是西部,而且是东部进一步发展的必然选择;东西部经济合作完全可以达到一种互利双赢的结果;政府在合作中发挥着重要的作用.     

Cournot–Walras equilibrium as a subgame perfect equilibrium

In this paper, we investigate the problem of the strategic foundation of the Cournot–Walras equilibrium approach. To this end, we respecify à la Cournot–Walras the mixed version of a model of simultaneous, noncooperative exchange, originally proposed by Lloyd S. Shapley. We show, through an example, that the set of the Cournot–Walras equilibrium allocations of this respecification does not coincide with the set of the Cournot–Nash equilibrium allocations of the mixed version of the original Shapley’s model. As the nonequivalence, in a one-stage setting, can be explained by the intrinsic two-stage nature of the Cournot–Walras equilibrium concept, we are led to consider a further reformulation of the Shapley’s model as a two-stage game, where the atoms move in the first stage and the atomless sector moves in the second stage. Our main result shows that the set of the Cournot–Walras equilibrium allocations coincides with a specific set of subgame perfect equilibrium allocations of this two-stage game, which we call the set of the Pseudo–Markov perfect equilibrium allocations. We would like to thank Pierpaolo Battigalli, Marcellino Gaudenzi, and an anonymous referee for their comments and suggestions.     

A best-response approach for equilibrium selection in two-player generalized Nash equilibrium problems

ABSTRACT

In this paper, we propose a best-response approach to select an equilibrium in a two-player generalized Nash equilibrium problem. In our model we solve, at each of a finite number of time steps, two independent optimization problems. We prove that convergence of our Jacobi-type method, for the number of time steps going to infinity, implies the selection of the same equilibrium as in a recently introduced continuous equilibrium selection theory. Thus the presented approach is a different motivation for the existing equilibrium selection theory, and it can also be seen as a numerical method. We show convergence of our numerical scheme for some special cases of generalized Nash equilibrium problems with linear constraints and linear or quadratic cost functions.     

Strong stability of Nash equilibria in load balancing games

We study strong stability of Nash equilibria in load balancing games of m(m 2)identical servers,in which every job chooses one of the m servers and each job wishes to minimize its cost,given by the workload of the server it chooses.A Nash equilibrium(NE)is a strategy profile that is resilient to unilateral deviations.Finding an NE in such a game is simple.However,an NE assignment is not stable against coordinated deviations of several jobs,while a strong Nash equilibrium(SNE)is.We study how well an NE approximates an SNE.Given any job assignment in a load balancing game,the improvement ratio(IR)of a deviation of a job is defined as the ratio between the pre-and post-deviation costs.An NE is said to be aρ-approximate SNE(ρ1)if there is no coalition of jobs such that each job of the coalition will have an IR more thanρfrom coordinated deviations of the coalition.While it is already known that NEs are the same as SNEs in the 2-server load balancing game,we prove that,in the m-server load balancing game for any given m 3,any NE is a(5/4)-approximate SNE,which together with the lower bound already established in the literature yields a tight approximation bound.This closes the final gap in the literature on the study of approximation of general NEs to SNEs in load balancing games.To establish our upper bound,we make a novel use of a graph-theoretic tool.     

On differential games with a feedback nash equilibrium

This note provides a lemma on differential games which possess a feedback Nash equilibrium (FNE). In particular, it shows that (i) a class of games with a degenerate FNE can be constructucted from every game which has a nondegenerate FNE and (ii) a class of games with a nondegenerate FNE can be constructed from every game which has a degenerate FNE.The author would like to thank an anonymous referee for invaluable comments and suggestions.     

On nash equilibrium solutions in nonzero-sum stochastic games with complete information

Two-person nonzero-sum stochastic games with complete information are considered. It is shown that it is sufficient to search the equilibrium solutions in a class of deterministic strategy pairs — the so-calledintimidation strategy pairs. Furthermore, properties of the set of all equilibrium losses of such strategy pairs are proved.     

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.     

A Nash-game approach to joint image restoration and segmentation

We propose a game-theoretic approach to simultaneously restore and segment noisy images. We define two players: one is restoration, with the image intensity as strategy, and the other is segmentation with contours as strategy. Cost functions are the classical relevant ones for restoration and segmentation, respectively. The two players play a static game with complete information, and we consider as solution to the game the so-called Nash equilibrium. For the computation of this equilibrium we present an iterative method with relaxation. The results of numerical experiments performed on some real images show the relevance and efficiency of the proposed algorithm.