This note presents a simple algorithm for characterizing the set of pure strategy Nash equilibria in a broad class of entry games. The algorithm alleviates much of the computational burden associated with recently developed econometric techniques for estimating payoff functions inferred from...

This paper extends the Stahl-Rubinstein model of bilateral bargaining to incorporate many players and multidimensional issue spaces. A central feature of our framework is that in each round of negotiations, a proposer is selected randomly. Our bargaining model consists of a sequence of...

Solves von Stackelberg equilibria in a Bertrand‐Edgeworth duopoly game. Shows that, initially, the environment is characterized by efficient rationing and capacity constraints. Since interest lies in sustaining monopoly outcomes from non‐co‐operative behaviour, introduces the buyout...