Rushes in Large Timing Games

We develop a continuum player timing game that subsumes standard wars of attrition and pre‐emption games, and introduces a new rushes phenomenon. Payoffs are continuous and single‐peaked functions of the stopping time and stopping quantile. We show that if payoffs are hump‐shaped in the quantile, then a sudden “rush” of players stops in any Nash or subgame perfect equilibrium. Fear relaxes the first mover advantage in pre‐emption games, asking that the least quantile beat the average; greed relaxes the last mover advantage in wars of attrition, asking just that the last quantile payoff exceed the average. With greed, play is inefficiently late: an accelerating war of attrition starting at optimal time, followed by a rush. With fear, play is inefficiently early: a slowing pre‐emption game, ending at the optimal time, preceded by a rush. The theory predicts the length, duration, and intensity of stopping, and the size and timing of rushes, and offers insights for many common timing games.     

A Competitive Model of Customization with Lead‐Time Effects

In this article, we study the competitive interactions between a firm producing standard products and a firm producing custom products. Consumers with heterogeneous preferences choose between n standard products, which may not meet their preferences exactly but are available immediately, and a custom product, available only after a certain lead time l. Standard products incur a variety cost that increases with n and custom products incur a lead time cost that is decreasing in the lead time l. We consider a two‐stage game wherein at stage 1, the standard product firm chooses the variety and the custom firm chooses the lead time and then both firms set prices simultaneously. We characterize the subgame‐perfect Nash equilibrium of the game. We find that both firms can coexist in equilibrium, either sharing the market as local monopolists or in a price‐competitive mode. The standard product firm may offer significant or minimal variety depending on the equilibrium outcome. We provide several interesting insights on the variety, lead time, and prices of the products offered and on the impact of problem parameters on the equilibrium outcomes. For instance, we show that the profit margin and price of the custom product are likely to be higher than that of standard products in equilibrium under certain conditions. Also, custom firms are more likely to survive and succeed in product markets with larger potential market sizes. Another interesting insight is that increased consumer sensitivity to product fit may result in lower lead time for the custom product.     

Bayesian Learning,Smooth Approximate Optimal Behavior,and Convergence to ε‐Nash Equilibrium

In this paper, I construct players' prior beliefs and show that these prior beliefs lead the players to learn to play an approximate Nash equilibrium uniformly in any infinitely repeated slightly perturbed game with discounting and perfect monitoring. That is, given any ε > 0, there exists a (single) profile of players' prior beliefs that leads play to almost surely converge to an ε‐Nash equilibrium uniformly for any (finite normal form) stage game with slight payoff perturbation and any discount factor less than 1.     

Backward Induction Foundations of the Shapley Value

We present a noncooperative game model of coalitional bargaining, closely based on that of Gul (1989) but solvable by backward induction. In this game, Gul's condition of “value additivity” does not suffice to ensure the existence of a subgame perfect Nash equilibrium that supports the Shapley value, but a related condition—“no positive value‐externalities”—does. Multiple equilibria can arise only in the event of ties, and with a mild restriction on tie‐break rules these equilibria all support the Shapley value.     

A Folk Theorem for Asynchronously Repeated Games

We prove a Folk Theorem for asynchronously repeated games in which the set of players who can move in period t, denoted by I_t, is a random variable whose distribution is a function of the past action choices of the players and the past realizations of I_τ's, τ=1, 2,…,t−1. We impose a condition, the finite periods of inaction (FPI) condition, which requires that the number of periods in which every player has at least one opportunity to move is bounded. Given the FPI condition together with the standard nonequivalent utilities (NEU) condition, we show that every feasible and strictly individually rational payoff vector can be supported as a subgame perfect equilibrium outcome of an asynchronously repeated game.     

基于合作性投资和价格策略的多式联运企业协作行为博弈分析

本文对联合运输中不同运输企业间的协作行为进行了研究。考虑了两家提供互补运输服务的寡头运输企业之间的合作和竞争的博弈决策问题,通过定义合作强度参数,并将其引入收益函数,构造了合作性投资和价格策略的两阶段动态博弈模型,讨论了该博弈子博弈完美Nash均衡解的存在条件,推出了一些重要的结论。研究发现:当双方投资效果系数组合在(0,1)区间时,随着市场潜量的增加,投资增长;随着价格弹性的增加,投资下降。而当双方投资效果系数组合在(1,2)区间时结论相反。最后通过算例和所设计的免疫遗传算法进行了不同参数环境下的数值模拟,验证了结论的正确性。     

Strategic Liquidity Provision in Limit Order Markets

We characterize and prove the existence of Nash equilibrium in a limit order market with a finite number of risk‐neutral liquidity providers. We show that if there is sufficient adverse selection, then pointwise optimization (maximizing in p for each q) in a certain nonlinear pricing game produces a Nash equilibrium in the limit order market. The need for a sufficient degree of adverse selection does not vanish as the number of liquidity providers increases. Our formulation of the nonlinear pricing game encompasses various specifications of informed and liquidity trading, including the case in which nature chooses whether the market‐order trader is informed or a liquidity trader. We solve for an equilibrium analytically in various examples and also present examples in which the first‐order condition for pointwise optimization does not define an equilibrium, because the amount of adverse selection is insufficient.     

Cooperation in Repeated Games When the Number of Stages is not Commonly Known

It is shown that an exponentially small departure from the common knowledge assumption on the number T of repetitions of the prisoners' dilemma already enables cooperation. More generally, with such a departure, any feasible individually rational outcome of any one-shot game can be approximated by a subgame perfect equilibrium of a finitely repeated version of that game. The sense in which the departure from common knowledge is small is as follows: (I) With probability one, the players know T with precision ±K. (ii) With probability 1 −ε, the players know T precisely; moreover, this knowledge is mutual of order εT. (iii) The deviation of T from its finite expectation is exponentially small.     

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.     

Supplier–Buyer Negotiation Games: Equilibrium Conditions and Supply Chain Efficiency

In a decentralized supply chain, supplier–buyer negotiations have a dynamic aspect that requires both players to consider the impact of their decisions on future decisions made by their counterpart. The interaction generally couples strongly the price decision of the supplier and the quantity decision of the buyer. We propose a basic model for a repeated supplier–buyer interaction, during several rounds. In each round, the supplier first quotes a price, and the buyer places an order at that price. We find conditions for existence and uniqueness of a well‐behaved subgame‐perfect equilibrium in the dynamic game. When costs are stationary and there are no holding costs, we identify some demand distributions for which these conditions are met, examine the efficiency of the equilibrium, and show that, as the number of rounds increases, the profits of the supply chain increase towards the supply chain optimum. In contrast, when costs vary over time or holding costs are present, the benefit from multi‐period interactions is reduced and after a finite number of time periods, supply chain profits stay constant even when the number of rounds increases.     

The Retail Space‐Exchange Problem with Pricing and Space Allocation Decisions

We consider retail space‐exchange problems where two retailers exchange shelf space to increase accessibility to more of their consumers in more locations without opening new stores. Using the Hotelling model, we find two retailers’ optimal prices, given their host and guest space in two stores under the space‐exchange strategy. Next, using the optimal space‐dependent prices, we analyze a non‐cooperative game, where each retailer makes a space allocation decision for the retailer's own store. We show that the two retailers will implement such a strategy in the game, if and only if their stores are large enough to serve more than one‐half of their consumers. Nash equilibrium for the game exists, and its value depends on consumers’ utilities and trip costs as well as the total available space in each retailer's store. Moreover, as a result of the space‐exchange strategy, each retailer's prices in two stores are both higher than the retailer's price before the space exchange, but they may or may not be identical.     

Continuity,Inertia, and Strategic Uncertainty: A Test of the Theory of Continuous Time Games

The theory of continuous time games (Simon and Stinchcombe (1989), Bergin and MacLeod (1993)) shows that continuous time interactions can generate very different equilibrium behavior than conventional discrete time interactions. We introduce new laboratory methods that allow us to eliminate natural inertia in subjects' decisions in continuous time experiments, thereby satisfying critical premises of the theory and enabling a first‐time direct test. Applying these new methods to a simple timing game, we find strikingly large gaps in behavior between discrete and continuous time as the theory suggests. Reintroducing natural inertia into these games causes continuous time behavior to collapse to discrete time‐like levels in some settings as predicted by subgame perfect Nash equilibrium. However, contra this prediction, the strength of this effect is fundamentally shaped by the severity of inertia: behavior tends towards discrete time benchmarks as inertia grows large and perfectly continuous time benchmarks as it falls towards zero. We provide evidence that these results are due to changes in the nature of strategic uncertainty as inertia approaches the continuous limit.     

Split‐Award Procurement Auctions—Can Bayesian Equilibrium Strategies Predict Human Bidding Behavior in Multi‐Object Auctions?

We analyze if and when symmetric Bayes Nash equilibrium predictions can explain human bidding behavior in multi‐object auctions. We focus on two sealed‐bid split‐award auctions with ex ante split decisions as they can be regularly found in procurement practice. These auction formats are straightforward multi‐object extensions of the first‐price sealed‐bid auction. We derive the risk‐neutral symmetric Bayes Nash equilibrium strategies and find that, although the two auction mechanisms yield the same expected costs to the buyer, other aspects of the two models, including the equilibrium bidding strategies, differ significantly. The strategic considerations in these auction formats are more involved than in single‐lot first‐price sealed‐bid auctions, and it is questionable whether expected utility maximization can explain human bidding behavior in such multi‐object auctions. Therefore, we analyzed the predictive accuracy of our equilibrium strategies in the laboratory. In human subject experiments we found underbidding, which is in line with earlier experiments on single‐lot first‐price sealed‐bid auctions. To control for regret, we organize experiments against computerized bidders, who play the equilibrium strategy. In computerized experiments where bid functions are only used in a single auction, we found significant underbidding on low‐cost draws. In experiments where the bid function is reused in 100 auctions, we could also control effectively for risk aversion, and there is no significant difference of the average bidding behavior and the risk‐neutral Bayes Nash equilibrium bid function. The results suggest that strategic complexity does not serve as an explanation for underbidding in split‐award procurement auctions, but risk aversion does have a significant impact.     

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.     

Reputation in Continuous‐Time Games

We study reputation dynamics in continuous‐time games in which a large player (e.g., government) faces a population of small players (e.g., households) and the large player's actions are imperfectly observable. The major part of our analysis examines the case in which public signals about the large player's actions are distorted by a Brownian motion and the large player is either a normal type, who plays strategically, or a behavioral type, who is committed to playing a stationary strategy. We obtain a clean characterization of sequential equilibria using ordinary differential equations and identify general conditions for the sequential equilibrium to be unique and Markovian in the small players' posterior belief. We find that a rich equilibrium dynamics arises when the small players assign positive prior probability to the behavioral type. By contrast, when it is common knowledge that the large player is the normal type, every public equilibrium of the continuous‐time game is payoff‐equivalent to one in which a static Nash equilibrium is played after every history. Finally, we examine variations of the model with Poisson signals and multiple behavioral types.     

基于工期协调的项目公司与承包商收益激励模型

从项目公司和承包商双层角度,考虑项目公司通过显性收益激励契约手段与单一标段承包商之间就工期目标优化问题进行协调决策.假设决策过程是一个完全信息的动态博弈过程,基于博弈论并应用二层规划方法建立了以项目公司为主方、承包商为从方的Stackelberg主从递阶收益激励模型,采用逆向归纳法并引入拉格朗日函数对问题进行分情形讨论,设计了遗传算法求解该非线性规划问题的子博弈精练纳什均衡解.算例结果表明,项目公司通过提供一定的收益激励而非传统指令性手段促使承包商在可压缩范围内积极主动地去压缩项目工期,可以实现项目工期控制目标协调优化和双方收益目标的帕累托改善.     

Optimal Dynamic Pricing of Perishable Items by a Monopolist Facing Strategic Consumers

We introduce a dynamic pricing model for a monopolistic company selling a perishable product to a finite population of strategic consumers (customers who are aware that pricing is dynamic and may time their purchases strategically). This problem is modeled as a stochastic dynamic game in which the company's objective is to maximize total expected revenues, and each customer maximizes the expected present value of utility. We prove the existence of a unique subgame‐perfect equilibrium pricing policy, provide equilibrium optimality conditions for both customer and seller, and prove monotonicity results for special cases. We demonstrate through numerical examples that a company that ignores strategic consumer behavior may receive much lower total revenues than one that uses the strategic equilibrium pricing policy. We also show that, when the initial capacity is a decision variable, it can be used together with the appropriate pricing policy to effectively reduce the impact of strategic consumer behavior. The proposed model is computationally tractable for problems of realistic size.     

On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games

A game is better-reply secure if for every nonequilibrium strategy x^* and every payoff vector limit u^* resulting from strategies approaching x^*, some player i has a strategy yielding a payoff strictly above u_i^* even if the others deviate slightly from x^*. If strategy spaces are compact and convex, payoffs are quasiconcave in the owner's strategy, and the game is better-reply secure, then a pure strategy Nash equilibrium exists. Better-reply security holds in many economic games. It also permits new results on the existence of symmetric and mixed strategy Nash equilibria.     

生产能力限制下价格Stackelberg博弈模型

生产能力限制条件下,同质产品市场中两企业以价格为决策变量进行Stackelberg竞争,采取有效配给规则。两企业对称情况下,生产能力较小时模型存在唯一的子博弈精炼纳什均衡,两企业销量达到自身生产能力,得到相同收益;生产能力较大时,追随企业匹配领头企业的价格,博弈存在后动优势。分析了领头企业生产能力大于追随企业的不对称情形,并给出相应均衡。算例分析表明,企业价格竞争的前提是充分大的供给能力,追随企业应在领头企业生产能力较大时进入市场。     

水平差异产品的内生定价策略选择

本文分析了一个存在定价策略选择下的三阶段Hotelling双头垄断模型,其中厂商可以选择采用单一定价策略或者歧视定价策略。模型的子博弈精炼纳什均衡表明厂商或者同时采用单一定价策略,或者同时采用歧视一价策略。当歧视定价的边际成本相对单一定价的边际成本不太高,或者消费乾注重产品特性差异时,厂商会同时选择歧视定价策略,尽管单一定价下厂商的利润要明显高于歧视定价下的利润;当歧视定价的边际成本相对较高或者消费者不太注重产品特性差异时,单一定价将成为厂商的最优选择。最后本文从社会最优的角度分析比较了两种这价策略下的社会净福利水平。