Testable restrictions of Nash equilibrium in games with continuous domains

Carvajal, Andrés

Testable restrictions of Nash equilibrium in games with continuous domains

Download

Borradores de Economía; No. 229

Date published

2003-01-18

Date

2003-01-18

Authors

Carvajal, Andrés

Document language

spa

Cargando estadísticas...

Ver PlumX Metrics

Las opiniones contenidas en el presente documento son responsabilidad exclusiva de los autores y no comprometen al Banco de la República ni a su Junta Directiva.

The opinions contained in this document are the sole responsibility of the author and do not commit Banco de la República or its Board of Directors.

Abstract

ior, for the case of a finite number of players who choose from continuous domains, subject to constraints. The results obtained here are negative. Assuming the observation of finite data sets, and using weak, but nontrivial, requirements for rationalizability, I show that the hypothesis is falsifiable, as it imposes nontautological, nonparametric testable restrictions. An assessment of these restrictions, however, shows that they are extremely weak, and that a researcher should expect, before observing the data set, that the test based on these restrictions will be passed by observed data. Without further specific assumptions, there do not exist harsher tests, since the conditions derived here also turn out to be sufficient. Moreover, ruling out the possibility that individuals may be cooperating so as to attain Pareto-efficient outcomes is impossible, as this behavior is in itself unfalsifiable with finite data sets. Imposing aggregation, or strategic complementarity and/or substitutability, if theoretically plausible, may provide for a harsher test.