Axiomatic Equilibrium Selection for Generic Two‐Player Games

For a finite game with perfect recall, a refinement of its set of Nash equilibria selects closed connected subsets, called solutions. Assume that each solution's equilibria use undominated strategies and some of its equilibria are quasi‐perfect, and that all solutions are immune to presentation effects; namely, if the game is embedded in a larger game with more pure strategies and more players such that the original players' feasible mixed strategies and expected payoffs are preserved regardless of what other players do, then the larger game's solutions project to the original game's solutions. Then, for a game with two players and generic payoffs, each solution is an essential component of the set of equilibria that use undominated strategies, and thus a stable set of equilibria as defined by Mertens (1989).     

Risk-Constrained Information Choice

Ahituv and Wand [1] applied an information economics model to the problem of making information choices using two decision criteria: expected (monetary) payoff and expected risk. Using risk-constrained optimization, they derived a solution in which the use of information is randomized by means of a mixed decision strategy. Although this solution is undominated when the expected payoff/expected risk trade-off boundary is convex, it may be dominated when the boundary is not convex. To avoid such dominance, it is necessary to adjust their solution by randomizing the choice of information rather than its use. For any feasible level of expected risk, this will yield an expected payoff equal to or greater than their solution produces and will always result in an undominated expected payoff/expected risk combination.     

土地使用权机制的实现与执行

机制设计者的目的是想最优化一个基于环境参数空间的社会福利函数,但是有关环境参数的相关信息分散于经济之中,因此机制设计者既想收集尽可能多的相关信息,又想充分利用这些信息制定一个社会决策。机制通常在两个框架下讨论,分为实现和执行,两者本质区别在于后者利用了对策性思维方式。本文给出了土地使用权机制在二维信息传递空间下的实现问题,将激励相容条件引入信息有效的机制实现中,给出了占优均衡下的机制执行。研究发现:在实话实说假设下,能够降低信息传递空间维度,并且通过一个信息有效的机制来实现政府目标函数;参与人能够利用私有信息时,实话实说不能成为一个纳什均衡,但在占优均衡下可以通过机制来执行。     

Repeated Games with Differential Time Preferences

When players have identical time preferences, the set of feasible repeated game payoffs coincides with the convex hull of the underlying stage- game payoffs. Moreover, all feasible and individually rational payoffs can be sustained by equilibria if the players are sufficiently patient. Neither of these facts generalizes to the case of different time preferences. First, players can mutually benefit from trading payoffs across time. Hence, the set of feasible repeated game payoffs is typically larger than the convex hull of the underlying stage-game payoffs. Second, it is not usually the case that every trade plan that guarantees individually rational payoffs can be sustained by an equilibrium, no matter how patient the players are. This paper provides a simple characterization of the sets of Nash and of subgame perfect equilibrium payoffs in two-player repeated games.     

Statistical Treatment Rules for Heterogeneous Populations

An important objective of empirical research on treatment response is to provide decision makers with information useful in choosing treatments. This paper studies minimax‐regret treatment choice using the sample data generated by a classical randomized experiment. Consider a utilitarian social planner who must choose among the feasible statistical treatment rules, these being functions that map the sample data and observed covariates of population members into a treatment allocation. If the planner knew the population distribution of treatment response, the optimal treatment rule would maximize mean welfare conditional on all observed covariates. The appropriate use of covariate information is a more subtle matter when only sample data on treatment response are available. I consider the class of conditional empirical success rules; that is, rules assigning persons to treatments that yield the best experimental outcomes conditional on alternative subsets of the observed covariates. I derive a closed‐form bound on the maximum regret of any such rule. Comparison of the bounds for rules that condition on smaller and larger subsets of the covariates yields sufficient sample sizes for productive use of covariate information. When the available sample size exceeds the sufficiency boundary, a planner can be certain that conditioning treatment choice on more covariates is preferable (in terms of minimax regret) to conditioning on fewer covariates.     

Efficient Repeated Implementation

This paper examines repeated implementation of a social choice function (SCF) with infinitely lived agents whose preferences are determined randomly in each period. An SCF is repeatedly implementable in Nash equilibrium if there exists a sequence of (possibly history‐dependent) mechanisms such that its Nash equilibrium set is nonempty and every equilibrium outcome path results in the desired social choice at every possible history of past play and realizations of uncertainty. We show, with minor qualifications, that in the complete information environment an SCF is repeatedly implementable in Nash equilibrium if and only if it is efficient. We also discuss several extensions of our analysis.     

The Coalitional Nash Bargaining Solution

The coalitional Nash bargaining solution is defined to be the core allocation for which the product of players' payoffs is maximal. We consider a non‐cooperative model with discounting in which one team may form and every player is randomly selected to make a proposal in every period. The grand team, consisting of all players, generates the largest surplus. But a smaller team may form. We show that as players get more patient if an efficient and stationary equilibrium exists, it must deliver payoffs that correspond to the coalitional Nash bargaining solution. We also characterize when an efficient and stationary equilibrium exists, which requires conditions that go beyond the nonemptiness of the core.     

信息不对称下委托代理契约纳什实施性研究

针对代理人逆向选择导致委托人无法将契约与代理人类型状态直接关联的矛盾,研究了信息不对称下委托代理契约的纳什实施性问题。通过建立信号空间上的纳什均衡与有效配置的映射关系,将委托人契约与代理人状态联系起来,并以完全信息下委托人的最优契约和逆向选择下的次优契约为例,研究分析委托人契约纳什实施的性质,当且仅当委托契约满足激励相容约束时,才具备纳什实施的惟一性,该结果为实务契约设计逼近激励可行契约提供了新的途径。     

Existence and Uniqueness of Maximal Reductions Under Iterated Strict Dominance

Iterated elimination of strictly dominated strategies is an order dependent procedure. It can also generate spurious Nash equilibria, fail to converge in countable steps, or converge to empty strategy sets. If best replies are well–defined, then spurious Nash equilibria cannot appear; if strategy spaces are compact and payoff functions are uppersemicontinuous in own strategies, then order does not matter; if strategy sets are compact and payoff functions are continuous in all strategies, then a unique and nonempty maximal reduction exists. These positive results extend neither to the better–reply secure games for which Reny has established the existence of a Nash equilibrium, nor to games in which (under iterated eliminations) any dominated strategy has an undominated dominator.     

Experimental Games on Networks: Underpinnings of Behavior and Equilibrium Selection

In this paper, we describe a series of laboratory experiments that implement specific examples of a general network structure. Specifically, actions are either strategic substitutes or strategic complements, and participants have either complete or incomplete information about the structure of a random network. Since economic environments typically have a considerable degree of complementarity or substitutability, this framework applies to a wide variety of settings. We examine behavior and equilibrium selection. The degree of equilibrium play is striking, in particular with incomplete information. Behavior closely resembles the theoretical equilibrium whenever this is unique; when there are multiple equilibria, general features of networks, such as connectivity, clustering, and the degree of the players, help to predict informed behavior in the lab. People appear to be strongly attracted to maximizing aggregate payoffs (social efficiency), but there are forces that moderate this attraction: (1) people seem content with (in the aggregate) capturing only the lion's share of the efficient profits in exchange for reduced exposure to loss, and (2) uncertainty about the network structure makes it considerably more difficult to coordinate on a demanding, but efficient, equilibrium that is typically implemented with complete information.     

政府监管与企业加入第三方国际环境审计的模糊博弈分析

针对政府环境监管与企业实施环境行为博弈分析中无法对双方的损益情况做出判断的问题,文章结合三角模糊数构建了政府监管和企业加入第三方国际环境审计的博弈模型,分别指出了纯策略纳什均衡和混合策略均衡情况需要满足的条件,讨论了政府与污染环境企业博弈策略的影响因素及作用机制,为政府监管与企业加入第三方国际环境审计顺利实施提供了相关建议。然后通过三角结构元方法对算例进行求解,验证了结论的正确性和可行性,引入三角模糊概念更加符合实际应用情况,拓展了第三方国际环境审计的应用背景。研究结果表明,政府对消费者消费的引导和对污染企业的惩罚对企业是否决定加入第三方国际环境审计起着举足轻重的作用。     

Multiperson Bargaining and Strategic Complexity

We investigate the effect of introducing costs of complexity in the n‐person unanimity bargaining game. As is well‐known, in this game every individually rational allocation is sustainable as a Nash equilibrium (also as a subgame perfect equilibrium if players are sufficiently patient and if n & 2). Moreover, delays in agreement are also possible in such equilibria. By limiting ourselves to a plausible notion of complexity that captures length of memory, we find that the introduction of complexity costs (lexicographically with the standard payoffs) does not reduce the range of possible allocations but does limit the amount of delay that can occur in any agreement. In particular, we show that in any n‐player game, for any allocation z, an agreement on z at any period t can be sustained as a Nash equilibrium of the game with complexity costs if and only if t≤n. We use the limit on delay result to establish that, in equilibrium, the strategies implement stationary behavior. Finally, we also show that ‘noisy Nash equilibrium’ with complexity costs sustains only the unique stationary subgame perfect equilibrium allocation.     

Optimal Use of Communication Resources

We study a repeated game with asymmetric information about a dynamic state of nature. In the course of the game, the better‐informed player can communicate some or all of his information to the other. Our model covers costly and/or bounded communication. We characterize the set of equilibrium payoffs and contrast these with the communication equilibrium payoffs, which by definition entail no communication costs.     

Strategic Experimentation with Exponential Bandits

We analyze a game of strategic experimentation with two‐armed bandits whose risky arm might yield payoffs after exponentially distributed random times. Free‐riding causes an inefficiently low level of experimentation in any equilibrium where the players use stationary Markovian strategies with beliefs as the state variable. We construct the unique symmetric Markovian equilibrium of the game, followed by various asymmetric ones. There is no equilibrium where all players use simple cut‐off strategies. Equilibria where players switch finitely often between experimenting and free‐riding all yield a similar pattern of information acquisition, greater efficiency being achieved when the players share the burden of experimentation more equitably. When players switch roles infinitely often, they can acquire an approximately efficient amount of information, but still at an inefficient rate. In terms of aggregate payoffs, all these asymmetric equilibria dominate the symmetric one wherever the latter prescribes simultaneous use of both arms.     

Bargaining,Reputation, and Equilibrium Selection in Repeated Games with Contracts

Consider a two‐person intertemporal bargaining problem in which players choose actions and offers each period, and collect payoffs (as a function of that period's actions) while bargaining proceeds. This can alternatively be viewed as an infinitely repeated game wherein players can offer one another enforceable contracts that govern play for the rest of the game. Theory is silent with regard to how the surplus is likely to be split, because a folk theorem applies. Perturbing such a game with a rich set of behavioral types for each player yields a specific asymptotic prediction for how the surplus will be divided, as the perturbation probabilities approach zero. Behavioral types may follow nonstationary strategies and respond to the opponent's play. In equilibrium, rational players initially choose a behavioral type to imitate and a war of attrition ensues. How much should a player try to get and how should she behave while waiting for the resolution of bargaining? In both respects she should build her strategy around the advice given by the “Nash bargaining with threats” (NBWT) theory developed for two‐stage games. In any perfect Bayesian equilibrium, she can guarantee herself virtually her NBWT payoff by imitating a behavioral type with the following simple strategy: in every period, ask for (and accept nothing less than) that player's NBWT share and, while waiting for the other side to concede, take the action Nash recommends as a threat in his two‐stage game. The results suggest that there are forces at work in some dynamic games that favor certain payoffs over all others. This is in stark contrast to the classic folk theorems, to the further folk theorems established for repeated games with two‐sided reputational perturbations, and to the permissive results obtained in the literature on bargaining with payoffs as you go.     

Identification and Estimation of a Discrete Game of Complete Information

We discuss the identification and estimation of discrete games of complete information. Following Bresnahan and Reiss (1990, 1991), a discrete game is a generalization of a standard discrete choice model where utility depends on the actions of other players. Using recent algorithms to compute all of the Nash equilibria to a game, we propose simulation‐based estimators for static, discrete games. We demonstrate that the model is identified under weak functional form assumptions using exclusion restrictions and an identification at infinity approach. Monte Carlo evidence demonstrates that the estimator can perform well in moderately sized samples. As an application, we study entry decisions by construction contractors to bid on highway projects in California. We find that an equilibrium is more likely to be observed if it maximizes joint profits, has a higher Nash product, uses mixed strategies, and is not Pareto dominated by another equilibrium.     

Economic Integration,International Capital Movements,and Labour Standards

Abstract. The paper develops a model where more integration initiates a movement towards the bottom of labour standards when increased integration enhances the flow of capital and so increases the marginal gain of a reduction in the strictness of standards. Moreover, a Pareto improving common international standard with higher strictness than in the Nash equilibrium can be negotiated among countries with the same preference for employed worker protection versus social efficiency. When preferences differ between countries, an agreed common or minimum strictness of labour standards will typically not be Pareto improving, but to the detriment of the country that gives less weight to the protection of employed workers. However, in this case there is also a Pareto improving solution, which raises the strictness of labour standards compared to the Nash equilibrium for both countries, but at the same time accepts different country standards reflecting their different preference.     

有限理性下序贯价格竞争的动态演化

本文建立了两个企业的序贯价格竞争模型，基于有限理性预期调整，研究了企业博弈的动态演化特征，分析了模型的均衡解及其稳定性条件。研究发现，边界解和纳什均衡解是一定参数条件下的局部稳定均衡。基于有限理性的动态博弈能够实现基于完全信息的纳什均衡。单纯跟随策略是一定条件下的均衡策略，并能使跟随企业获得更高的销售价格。企业之间报价的相互跟随程度和企业预期的调整速度将会影响均衡点的稳定性。本文对模型进行了数值模拟分析，当参数不满足稳定性条件时会出现分岔、奇异吸引子等混沌现象。本文的主要研究结果对相关行业的企业竞争和稳定市场有启发意义。     

道德约束环境下的Nash实施

探讨了代理人发送信号的成本对社会选择规则可实施性的影响,证明了在存在道德约束的实施环境中,单调性不再是一个社会选择规则可Nash实施的必要条件。当代理人数量大于2时,满足一致性条件的社会选择规则都是可Nash实施的。当代理人数量等于2,满足交叉性条件和一致性条件的社会选择规则是可Nash实施的。结论表明:在实际的实施问题中,社会选择规则可实施的范围可能远远大于预期,在存在道德约束的实施环境中,一些不满足单调性但却满足一致性条件的社会选择规则,如Pareto规则都是可Nash实施的。     

Berk–Nash Equilibrium: A Framework for Modeling Agents With Misspecified Models

We develop an equilibrium framework that relaxes the standard assumption that people have a correctly specified view of their environment. Each player is characterized by a (possibly misspecified) subjective model, which describes the set of feasible beliefs over payoff‐relevant consequences as a function of actions. We introduce the notion of a Berk–Nash equilibrium: Each player follows a strategy that is optimal given her belief, and her belief is restricted to be the best fit among the set of beliefs she considers possible. The notion of best fit is formalized in terms of minimizing the Kullback–Leibler divergence, which is endogenous and depends on the equilibrium strategy profile. Standard solution concepts such as Nash equilibrium and self‐confirming equilibrium constitute special cases where players have correctly specified models. We provide a learning foundation for Berk–Nash equilibrium by extending and combining results from the statistics literature on misspecified learning and the economics literature on learning in games.