I present a simple and fast algorithm that finds all the pure-strategy Nash equilibria in games with strategic complementarities. This is the first non-trivial algorithm for finding all pure-strategy Nash equilibria

Echenique, Federico

English

Caltech Authors - Main

Finding all equilibria in games of strategic complements

(2004b): “A General Equilibrium Model for Industries with Price and Service Competition,” Forthcoming in Operations Research.

An Iterative Method of Solving a

Capacity choice and allocation: strategic behavior and supply chain performance,”

Computing Equilibria for Two-Person Games,”

Computing Normal-Form Perfect Equilibria for Extensive Two-Person Games,”

Computing Supergame Equilibria,” mimeo Hoover Institution.

Equilibrium Points in Nonzero-Sum n-Person Submodular Games,”

Federgruen (2004a): “Decentralized Supply Chains with Competing Retailers under Demand Uncertainty,” Forthcoming in Management Science.

Finding All Equilibria,” Caltech Social Science Working Paper 1153.

Game Theory in Supply Chain Analysis,” Forthcoming in the collecction ”Supply Chain Analysis is the eBusiness Era.”.

Mixed Strategy Equilibria in Games of Strategic Complements are unstable,”

Monotone Comparative Statics,”

Nash Equilibrium with Strategic Complementarities,”

Oligopoly Pricing.

On the Eﬀects of Entry in

Rationalizability, Learning and Equilibrium

Revenue management games: horizontal and vertical competition,”

Stock wars: inventory competition in a two echelon supply chain,”

Supermodularity and Complementarity.

The Design and Analysis of Computer Algorithms.

The Set of Nash Equilibria of a Supermodular Game Is a Complete Lattice,”

http://authors.library.caltech.edu/20225/1/echenique-JournalofEconomicTheory-135-2007.pdf

Finding all equilibria in games of strategic complements

Abstract

Similar works

Full text

Available Versions

Caltech Authors - Main